The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Graph indexing: a frequent structure-based approach
Abstract
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graph-based indices. In this paper, we investigate the issues of indexing graphs and propose a novel solution by applying a graph mining technique. Different from the existing path-based methods, our approach, called gIndex, makes use of frequent substructure as the basic indexing feature. Frequent substructures are ideal candidates since they explore the intrinsic characteristics of the data and are relatively stable to database updates. To reduce the size of index structure, two techniques, size-increasing support constraint and discriminative fragments, are introduced. Our performance study shows that gIndex has 10 times smaller index size, but achieves 3--10 times better performance in comparison with a typical path-based method, GraphGrep. The gIndex approach not only provides and elegant solution to the graph indexing problem, but also demonstrates how database indexing and query processing can benefit form data mining, especially frequent pattern mining. Furthermore, the concepts developed here can be applied to indexing sequences, trees, and other complicated structures as well.
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
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Self-citationDataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
Goldman, R., & Widom, J. (1997) · Cited by 1,136
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_2 · Cited by 1,039
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
Self-citationFast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
Mining molecular fragments: finding relevant substructures of molecules
Borgelt, C., & Berthold, M. R. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183885 · Cited by 442
Threading a database of protein cores
Madej, T., Gibrat, J., & Bryant, S. H. (1995) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340230309 · Cited by 440
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
Cited by
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Self-citationPreserving Privacy in Social Networks Against Neighborhood Attacks
Zhou, B., & Pei, J. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497459 · Cited by 719
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
Graphs-at-a-time: query language and access methods for graph databases
He, H., & Singh, A. K. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376660 · Cited by 450
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453899 · Cited by 401
Comparing stars: on approximating graph edit distance
Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., & Zhou, L. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687631 · Cited by 399
Discriminative Frequent Pattern Analysis for Effective Classification
Cheng, H., Yan, X., Han, J., & Hsu, C.-W. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367917 · Cited by 357
Self-citationA survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
GraMi: frequent subgraph and pattern mining in a single large graph
Elseidy, M., Abdelhamid, E., Skiadopoulos, S., & Kalnis, P. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732286.2732289 · Cited by 315
Substructure similarity search in graph databases
Yan, X., Yu, P. S., & Han, J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066244 · Cited by 314
Self-citationLarge-scale malware indexing using function-call graphs
Hu, X., Chiueh, T.-C., & Shin, K. G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653736 · Cited by 312
Open challenges for data stream mining research
Krempl, G., Žliobaite, I., Brzeziński, D., Hüllermeier, E., Last, M., Lemaire, V., Noack, T., Shaker, A., Sievi, S., Spiliopoulou, M., et al. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2674026.2674028 · Cited by 295
Closure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Mining significant graph patterns by leap search
Yan, X., Cheng, H., Han, J., & Yu, P. S. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376662 · Cited by 291
Self-citationTurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC
Han, W.-S., Lee, S., Park, K., Lee, J.-H., Kim, M.-S., Kim, J., & Yu, H. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487581 · Cited by 259
SAGA: a subgraph matching tool for biological graphs
Tian, Y., McEachin, R. C., Santos, C., States, D. J., & Patel, J. M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl571 · Cited by 253
Metadata
- Authors
- Yan, X., Yu, P. S., & Han, J.
- Venue
- Proceedings of the 2004 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 335-346
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2110034858
- Cited by
- 637
- References
- 13
- FWCI
- 12.27
- 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.