The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Algorithmics and applications of tree and graph searching
Abstract
Modern search engines answer keyword-based queries extremely efficiently. The impressive speed is due to clever inverted index structures, caching, a domain-independent knowledge of strings, and thousands of machines. Several research efforts have attempted to generalize keyword search to keytree and keygraph searching, because trees and graphs have many applications in next-generation database systems. This paper surveys both algorithms and applications, giving some emphasis to our own work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
Goldman, R., & Widom, J. (1997) · Cited by 1,136
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
Data on the Web from relations to semistructured data and XML
Abiteboul, S., Buneman, P., & Suciu, D. M. (2000) · Cited by 1,062
The Lorel query language for semistructured data
Abiteboul, S., Quass, D., McHugh, J., Widom, J., & Wiener, J. L. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050005 · Cited by 1,058
A distance measure between attributed relational graphs for pattern recognition
Sanfeliu, A., & Fu, K.-S. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313167 · Cited by 999
Abiteboul, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62222-5_33 · Cited by 746
Fast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
An eigendecomposition approach to weighted graph matching problems
Umeyama, S. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.6778 · Cited by 727
Efficient Filtering of XML Documents for Selective Dissemination of Information
Altınel, M., & Franklin, M. J. M. (2000) · Cited by 548
Deutsch, A., Fernández, M., Florescu, D., Levy, A. Y., & Suciu, D. M. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00020-1 · Cited by 544
A query language and optimization techniques for unstructured data
Buneman, P., Davidson, S. B., Hillebrand, G. G., & Suciu, D. M. (1996) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/233269.233368 · Cited by 535
Structural matching in computer vision using probabilistic relaxation
Christmas, W. J., Kittler, J., & Petrou, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400565 · Cited by 495
Hoffmann, C. M., & O’Donnell, M. J. (1982) · Journal of the ACM · doi:10.1145/322290.322295 · Cited by 489
Inexact graph matching for structural pattern recognition
Bunke, H., & Allermann, G. (1983) · Pattern Recognition Letters · doi:10.1016/0167-8655(83)90033-8 · Cited by 487
Change detection in hierarchically structured information
Chawathe, S. S., Rajaraman, A., Garcia-Molina, H., & Widom, J. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233366 · Cited by 484
Substructure Discovery Using Minimum Description Length and Background Knowledge
Cook, D. J., & Holder, L. B. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.43 · Cited by 480
Buneman, P. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263675 · Cited by 448
Finding Regular Simple Paths in Graph Databases
Mendelzon, A. O., & Wood, P. T. (1995) · SIAM Journal on Computing · doi:10.1137/s009753979122370x · Cited by 399
On the editing distance between unordered labeled trees
Zhang, K., Statman, R., & Shasha, D. E. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90136-j · Cited by 359
Self-citationAn Efficient Algorithm for Graph Isomorphism
Corneil, D. G., & Gotlieb, C. C. (1970) · Journal of the ACM · doi:10.1145/321556.321562 · Cited by 334
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
Tsai, W.-H., & Fu, K.-S. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310127 · Cited by 327
Meaningful change detection in structured data
Chawathe, S. S., & García-Molina, H. (1997) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/253260.253266 · Cited by 320
Mendelzon, A. O., Mihaila, G. A., & Milo, T. (1997) · International Journal on Digital Libraries · doi:10.1007/s007990050004 · Cited by 312
Suffix arrays: a new method for on-line string searches
Manber, U., & Myers, E. W. (1990) · doi:10.5555/320176.320218 · Cited by 293
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
Wong, A. K. C., & You, M. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767707 · Cited by 291
Catching the boat with Strudel: experiences with a Web-site management system
Fernández, M., Florescu, D., Kang, J., Levy, A., & Suciu, D. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276341 · Cited by 273
Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining
Heckerman, D. E., Uthurusamy, R., Mannila, H., & Pregibon, D. (1997) · AAAI Press eBooks · Cited by 271
A linear programming approach for the weighted graph matching problem
Almohamad, H. A., & Duffuaa, S. O. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.211474 · Cited by 241
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
Levi, G. (1973) · Calcolo · doi:10.1007/bf02575586 · Cited by 234
Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
Llados, J., Marti, E., & Villanueva, J. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954603 · Cited by 233
Error correcting graph matching: on the influence of the underlying cost function
Bunke, H. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.790431 · Cited by 229
A graph distance metric combining maximum common subgraph and minimum common supergraph
Fernández, M.-L., & Valiente, G. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00017-4 · Cited by 206
Ordered and Unordered Tree Inclusion
Kilpeläinen, P., & Mannila, H. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539791218202 · Cited by 202
A graph distance measure for image analysis
Eshera, M. A., & Fu, K.-S. (1984) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1984.6313232 · Cited by 185
GraphDB: Modeling and Querying Graphs in Databases
Güting, R. H. (1994) · Cited by 181
Tree Matching Problems with Applications to Structured Text Databases
Kilpeläinen, P. (1992) · Työväentutkimus Vuosikirja · Cited by 172
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
A system for approximate tree matching
Wang, J. T.-L., Zhang, K., Jeong, K., & Shasha, D. E. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.298173 · Cited by 152
Self-citationFast text searching for regular expressions or automaton searching on tries
Baeza-Yates, R. A., & Gonnet, G. H. (1996) · Journal of the ACM · doi:10.1145/235809.235810 · Cited by 137
A Web Odyssey: from Codd to XML
Vianu, V. (2001) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/375551.375554 · Cited by 127
Approximate Tree Matching in the Presence of Variable Length Don′t Cares
Zhang, K. Z., Shasha, D. E., & Wang, J. T.-L. (1994) · Journal of Algorithms · doi:10.1006/jagm.1994.1003 · Cited by 91
Self-citationNonlinear pattern matching in trees
Ramesh, R., & Ramakrishnan, I. V. (1992) · Journal of the ACM · doi:10.1145/128749.128752 · Cited by 65
Retrieval from hierarchical texts by partial patterns
Kilpeläinen, P., & Mannila, H. (1993) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/160688.160722 · Cited by 61
ATreeGrep: approximate searching in unordered trees
Shasha, D. E., Wang, J. T. L., Shan, H., & Zhang, K. (2003) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdm.2002.1029709 · Cited by 60
Self-citationSelectively estimation for Boolean queries
Chen, Z., Koudas, N., Korn, F. R., & Muthukrishnan, S. (2000) · doi:10.1145/335168.335225 · Cited by 59
Algorithms for string searching
Baeza-Yates, R. A. (1989) · ACM SIGIR Forum · doi:10.1145/74697.74700 · Cited by 48
Cordella, L. P., Foggia, P., Sansone, C., et al. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546934 · Cited by 34
Automated discovery of active motifs in multiple RNA secondary structures
Wang, J. T. L., Shapiro, B. A., Shasha, D. E., Zhang, K., & Chang, C.-Y. (1996) · Cited by 25
Self-citation
Cited by
Survey of graph database models
Angles, R., & Gutierrez, C. (2008) · ACM Computing Surveys · doi:10.1145/1322432.1322433 · Cited by 1,706
A Survey of Schema-Based Matching Approaches
Shvaiko, P., & Euzenat, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11603412_5 · Cited by 1,147
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
Provenance and scientific workflows: challenges and opportunities
Davidson, S. B., & Freire, J. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376772 · Cited by 468
Metadata
- Authors
- Shasha, D., Wang, J. T. L., & Giugno, R.
- Venue
- Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2002-06-03
- Pages
- 39-52
- OpenAlex
- W2050137450
- Cited by
- 387
- References
- 53
- FWCI
- 12.23
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.