Efficient relational techniques for processing graph queries

Journal of Computer Science and Technology

Volumn 25, Issue 6, 2010, Pages 1237-1255

  Sakr, Sherif ^a,b   Al Naymat, Ghazi ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CSIRO   (Australia)

Author keywords

graph database; graph query; subgraph query; supergraph query

Indexed keywords

COMPLEX OBJECTS; GRAPH DATABASE; GRAPH FEATURES; GRAPH QUERIES; HARD PROBLEMS; INDEXING MECHANISMS; OPTIMIZERS; PAIR-WISE COMPARISON; PROCESSING GRAPHS; PROTEIN INTERACTION; QUERYING MECHANISMS; RELATIONAL DATABASE MANAGEMENT SYSTEMS; RELATIONAL MODEL; RELATIONAL TECHNIQUES; SCALABLE PERFORMANCE; SOCIAL NETWORKS; SUBGRAPHS; SUPERGRAPH; SYNTHETIC DATASETS; UNDERLYING GRAPHS; XML DATA;

CHEMICAL COMPOUNDS; INDEXING (OF INFORMATION); METADATA; SEMANTIC WEB; SEMANTICS;

RELATIONAL DATABASE SYSTEMS;

EID: 78650282785     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-010-9402-5     Document Type: Article

References (48)

1. Manola F, Miller E. RDF primer: World wide web consortium proposed recommendation. February 2004. http://www.w3.org/TR/rdfprimer/.
2. Cai D, Shao Z, He X, Yan X, Han J. Community mining from multi-relational networks. In Proc. the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, Oct. 3-7, 2005, pp.445-452.
3. Q Yang S Sze 2007 Path matching and graph matching in biological networks Journal of Computational Biology 14 1 56 67 10.1089/cmb.2006.0076 2299876 (Pubitemid 46535306)
4. Huan J, Wang W, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A.Mining protein family specific residue packing patterns from protein structure graphs. In Proc. the Eighth Annual International Conference on Computational Molecular Biology, San Diego, USA, Mar. 27-31, 2004, pp.308-315.
5. Klinger S, Austin J. Chemical similarity searching using a neural graph matcher. In Proc. the 13th European Symposium on Artificial Neural Networks (ESANN), Bruges, Belgium, Apr. 27-29, 2005, pp.479-484.
6. P Willett J Barnard G Downs 1998 Chemical similarity searching Journal of Chemical Information and Computer Sciences 38 6 983 996
7. Sakr S, Awad A. A framework for querying graph-based business process models. In Proc. the 19th International World Wide Web Conference (WWW), Raleigh, USA, Apr. 26-30, 2010, pp.1297-1300.
8. Cheng J, Ke Y, Ng W, Lu A. FG-Index: Towards verificationfree query processing on graph databases. In Proc. the ACM SIGMOD International Conference on Management of Data, San Diego, USA, Aug. 5-9, 2007, pp.857-872.
9. Giugno R, Shasha D. GraphGrep: A fast and universal method for querying graphs. In Proc. the IEEE International Conference in Pattern Recognition (ICPR), Quebec, Canada, Aug. 11-15, 2002, pp.112-115.
10. Jiang H, Wang H, Yu P, Zhou S. A novel approach for efficient search in graph databases. In Proc. the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey, Apr. 15-20, 2007, pp.566-575. (Pubitemid 47422060)
11. Williams D, Huan J, Wang W. Graph database indexing using structured graph decomposition. In Proc. the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey, Apr. 15-20, 2007, pp.976-985.
12. Yan X, Yu P, Han J. Graph indexing: A frequent structure based approach. In Proc. the ACM SIGMOD International Conference on Management of Data, Los Angeles, USA, Aug. 8-12, 2004, pp.335-346.
13. Zhang S, Hu M, Yang J. TreePi: A novel graph indexing method. In Proc. the 23rd International Conference on Data Engineering, Istanbul, Turkey, Apr. 15-20, 2007, pp.966-975.
14. Zou L, Chen L, Yu J, Lu Y. A novel spectral coding in a large graph database. In Proc. the 11th International Conference on Extending Database Technology (EDBT), Nantes, France, Mar. 25-29, 2008, pp.181-192.
15. Chen C, Yan X, Yu P, Han J, Zhang D, Gu X. Towards graph containment search and indexing. In Proc. the 33rd International Conference on Very Large Data Bases (VLDB), Vienna, Austria, Sept. 23-27, 2007, pp.926-937.
16. Zhang S, Li J, Gao H, Zou Z. A novel approach for efficient supergraph query processing on graph databases. In Proc. the 12th International Conference on Extending Database Technology (EDBT), Saint-Petersburg, Russia, Mar. 24-26, 2009, pp.204-215.
17. Tian Y, Patel J. TALE: A tool for approximate large graph matching. In Proc. of the 24th International Conference on Data Engineering (ICDE), Cancun, Mexico, Apr. 7-12, 2008, pp.963-972.
18. Yan X, Yu P, Han J. Substructure similarity search in graph databases. In Proc. the ACM SIGMOD International Conference on Management of Data, Los Angeles, USA, Jul. 31-Aug. 4, 2005, pp.766-777.
19. Y Ke J Cheng W Ng 2008 Efficient correlation search from graph databases IEEE Transactions on Knowledge and Data Engineering 20 12 1601 1615 10.1109/TKDE.2008.86
20. Zou L, Chen L, Lu Y. Top-K correlation sub-graph search in graph databases. In Proc. the International Conference on Database Systems for Advanced Applications (DASFAA), Brisbane, Australia, Apr. 21-23, 2009, pp.168-185.
21. S Cohen P Hurley K Schulz, et al. 2006 Scientific formats for object-relational database systems: A study of suitability and performance SIGMOD Record 35 2 10 15 10.1145/1147376.1147378
22. V Botea D Mallett M Nascimento J Sander 2008 PIST: An efficient and practical indexing technique for historical spatio-temporal point data GeoInformatica 12 2 143 168 10.1007/s10707-007-0030-3 (Pubitemid 351445271)
23. Grust T, Sakr S, Teubner J. XQuery on SQL hosts. In Proc. the 30th International Conference on Very Large Data Bases, Toronto, Canada, Aug. 31-Sept. 3, 2004, pp.252-263.
24. Grust T, Mayr M, Rittinger J et al. A SQL: 1999 code generator for the pathfinder XQuery compiler. In Proc. the 26th ACM SIGMOD International Conference on Management of Data, San Diego, USA, Aug. 5-9, 2007, pp.1162-1164.
25. S Sakr 2008 Algebraic-based XQuery cardinality estimation International Journal of Web Information Systems (IJWIS) 4 1 7 46
26. J Teubner T Grust S Maneth S Sakr 2008 Dependable cardinality forecasts for XQuery Proceedings of the VLDB Endowment (PVLDB) 1 1 463 477
27. Graefe G. Sorting and indexing with partitioned B-trees. In Proc. the 1st International Conference on Data Systems Research (CIDR), Asilomar, USA, Jan. 5-8, 2003.
28. Grust T, Rittinger J, Teubner J. Why off-the-shelf RDBMSs are better at XPath than you might expect. In Proc. the 26th ACM SIGMOD International Conference on Management of Data, San Diego, USA, Aug. 5-9, 2007, pp.949-958.
29. Bruno N, Chaudhuri S, Ramamurthy R. Power hints for query optimization. In Proc. the 25th International Conference on Data Engineering (ICDE), Shanghai, China, Mar. 29-Apr. 2, 2009, pp.469-480.
30. D Florescu D Kossmann 1999 Storing and querying XML data using an RDMBS IEEE Data Engineering Bulletin 22 3 27 34
31. Sakr S. Storing and querying graph data using efficient relational processing techniques. In Proc. the 3rd International United Information Systems Conference (UNISCON), Sydney, Australia, Apr. 21-24, 2009, pp.379-392.
32. Beyer K, Haas P, Reinwald B et al. On synopses for distinctvalue estimation under multiset operations. In Proc. the ACM SIGMOD International Conference on Management of Data, San Diego, USA, August 5-9, 2007, pp.199-210.
33. Chakkappen S, Cruanes T, Dageville B, Jiang L, Shaft U, Su H, Zait M. Efficient and scalable statistics gathering for large databases in Oracle 11g. In Proc. the ACM SIGMOD International Conference on Management of Data, Los Angeles, USA, Aug. 11-15, 2008, pp.1053-1064.
34. Graefe G, Fayyad U, Chaudhuri S. On the efficient gathering of sufficient statistics for classification from large SQL databases. In Proc. the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), New York City, USA, Aug. 27-31, 1998, pp.204-208.
35. Goldman R, Widom J. Enabling query formulation and optimization in semistructured databases. In Proc. the 23rd International Conference on Very Large Data Bases (VLDB), Athens, Greece, Aug. 25-29, 1997, pp.436-445.
36. Baeza-Yates R, Ribeiro-Neto B. Modern Information Retrieval. ACM Press/Addison-Wesley, 1999.
37. Aboulnaga A, Alameldeen A, Naughton J. Estimating the selectivity of XML path expressions for Internet scale applications. In Proc. the 27th Int. Conf. Very Large Data Bases (VLDB), Rome, Italy, Sept. 11-14, 2001, pp.591-600.
38. G Graefe 1993 Query evaluation techniques for large databases ACM Computing Surveys 25 2 73 170 10.1145/152610.152611 (Pubitemid 23712749)
39. Agrawal S, Narasayya V, Yang B. Integrating vertical and horizontal partitioning into automated physical database design. In Proc. the ACM SIGMOD Int. Conf. Management of Data, Toronto, Canada, Aug. 31-Sept. 3, 2004, pp.359-370.
40. Agrawal S, S Chaudhuri, Narasayya V. Automated selection of materialized views and indexes in SQL databases. In Proc. the 26th International Conference on Very Large Data Bases (VLDB), Cairo, Egypt, Sept. 10-14, 2000, pp.496-505.
41. Agrawal S, Chu E, Narasayya V. Automatic physical design tuning: Workload as a sequence. In Proc. the ACM SIGMOD International Conference on Management of Data, Chicago, USA, Jun. 26-29, 2006, pp.683-694.
42. Developmental therapeutics program. NCI/NIH. http://dtp.nci.nih.gov/.
43. Kuramochi M, Karypis G. Frequent subgraph discovery. In Proc. the IEEE International Conference on Data Mining (ICDM), San Jose, USA, Nov. 29-Dec. 2, 2001, pp.313-320.
44. S Sakr G Al-Naymat 2010 Graph indexing and querying: A review International Journal of Web Information Systems (IJWIS) 6 2 101 120 10.1108/17440081011053104
45. Sakr S. GraphREL: A decomposition-based and selectivityaware relational framework for processing sub-graph queries. In Proc. the 14th International Conference on Database Systems for Advanced Applications (DASFAA), Brisbane, Australia, Apr. 21-23, 2009, pp.123-137.
46. Zhao P, Yu J, Yu P. Graph indexing: Tree + delta ≥ graph. In Proc. the 33rd Int. Conf. Very Large Data Bases (VLDB), Vienna, Austria, Sept. 23-27, 2007, pp.938-949.
47. He H, Singh A. Closure-tree: An index structure for graph queries. In Proc. the 22nd International Conference on Data Engineering (ICDE), Atlanta, USA, Apr. 3-8, 2006, pp.38-52.
48. Guttman A. R-trees: A dynamic index structure for spatial searching. In Proc. the ACM SIGMOD Int. Conf. Management of Data, Minneapolis, USA, Jul. 23-27, 1984, pp.47-57.