{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:30:18Z","timestamp":1740720618408,"version":"3.38.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T00:00:00Z","timestamp":1288569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11390-010-9402-5","type":"journal-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T06:05:16Z","timestamp":1288764316000},"page":"1237-1255","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Relational Techniques for Processing Graph Queries"],"prefix":"10.1007","volume":"25","author":[{"given":"Sherif","family":"Sakr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghazi","family":"Al-Naymat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"key":"9402_CR1","unstructured":"Manola F, Miller E. RDF primer: World wide web consortium proposed recommendation. February 2004. http:\/\/www.w3.org\/TR\/rdfprimer\/ ."},{"key":"9402_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013452.","DOI":"10.1007\/11564126_44"},{"issue":"1","key":"9402_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1089\/cmb.2006.0076","volume":"14","author":"Q Yang","year":"2007","unstructured":"Yang Q, Sze S. Path matching and graph matching in biological networks. Journal of Computational Biology, 2007, 14(1): 56\u201367.","journal-title":"Journal of Computational Biology"},{"key":"9402_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013315.","DOI":"10.1145\/974614.974655"},{"key":"9402_CR5","unstructured":"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\u2013484."},{"issue":"6","key":"9402_CR6","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P Willett","year":"1998","unstructured":"Willett P, Barnard J, Downs G. Chemical similarity searching. Journal of Chemical Information and Computer Sciences, 1998, 38(6): 983\u2013996.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"9402_CR7","doi-asserted-by":"crossref","unstructured":"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\u20131300.","DOI":"10.1145\/1772690.1772906"},{"key":"9402_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013872.","DOI":"10.1145\/1247480.1247574"},{"key":"9402_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013115.","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"9402_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013575.","DOI":"10.1109\/ICDE.2007.367902"},{"key":"9402_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013985.","DOI":"10.1109\/ICDE.2007.368956"},{"key":"9402_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013346.","DOI":"10.1145\/1007568.1007607"},{"key":"9402_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013975.","DOI":"10.1109\/ICDE.2007.368955"},{"key":"9402_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013192.","DOI":"10.1145\/1352431.1352457"},{"key":"9402_CR15","unstructured":"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\u2013937."},{"key":"9402_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013215.","DOI":"10.1145\/1516360.1516385"},{"key":"9402_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013972.","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"9402_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013777.","DOI":"10.1145\/1066157.1066244"},{"issue":"12","key":"9402_CR19","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TKDE.2008.86","volume":"20","author":"Y Ke","year":"2008","unstructured":"Ke Y, Cheng J, Ng W. Efficient correlation search from graph databases. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(12): 1601\u20131615.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9402_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013185.","DOI":"10.1007\/978-3-642-00887-0_14"},{"issue":"2","key":"9402_CR21","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1147376.1147378","volume":"35","author":"S Cohen","year":"2006","unstructured":"Cohen S, Hurley P, Schulz K et al. Scientific formats for object-relational database systems: A study of suitability and performance. SIGMOD Record, 2006, 35(2): 10\u201315.","journal-title":"SIGMOD Record"},{"issue":"2","key":"9402_CR22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10707-007-0030-3","volume":"12","author":"V Botea","year":"2008","unstructured":"Botea V, Mallett D, Nascimento M, Sander J. PIST: An efficient and practical indexing technique for historical spatio-temporal point data. GeoInformatica, 2008, 12(2): 143\u2013168.","journal-title":"GeoInformatica"},{"key":"9402_CR23","doi-asserted-by":"crossref","unstructured":"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\u2013263.","DOI":"10.1016\/B978-012088469-8.50025-5"},{"key":"9402_CR24","doi-asserted-by":"crossref","unstructured":"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\u20131164.","DOI":"10.1145\/1247480.1247642"},{"issue":"1","key":"9402_CR25","first-page":"7","volume":"4","author":"S Sakr","year":"2008","unstructured":"Sakr S. Algebraic-based XQuery cardinality estimation. International Journal of Web Information Systems (IJWIS), 2008, 4(1): 7\u201346.","journal-title":"International Journal of Web Information Systems (IJWIS)"},{"issue":"1","key":"9402_CR26","doi-asserted-by":"crossref","first-page":"463","DOI":"10.14778\/1453856.1453908","volume":"1","author":"J Teubner","year":"2008","unstructured":"Teubner J, Grust T, Maneth S, Sakr S. Dependable cardinality forecasts for XQuery. Proceedings of the VLDB Endowment (PVLDB), 2008, 1(1): 463\u2013477.","journal-title":"Proceedings of the VLDB Endowment (PVLDB)"},{"key":"9402_CR27","unstructured":"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."},{"key":"9402_CR28","doi-asserted-by":"crossref","unstructured":"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\u2013958.","DOI":"10.1145\/1247480.1247591"},{"key":"9402_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013480.","DOI":"10.1109\/ICDE.2009.68"},{"issue":"3","key":"9402_CR30","first-page":"27","volume":"22","author":"D Florescu","year":"1999","unstructured":"Florescu D, Kossmann D. Storing and querying XML data using an RDMBS. IEEE Data Engineering Bulletin, 1999, 22(3): 27\u201334.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"9402_CR31","doi-asserted-by":"crossref","unstructured":"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\u2013392.","DOI":"10.1007\/978-3-642-01112-2_39"},{"key":"9402_CR32","doi-asserted-by":"crossref","unstructured":"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\u2013210.","DOI":"10.1145\/1247480.1247504"},{"key":"9402_CR33","doi-asserted-by":"crossref","unstructured":"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\u20131064.","DOI":"10.1145\/1376616.1376721"},{"key":"9402_CR34","unstructured":"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\u2013208."},{"key":"9402_CR35","unstructured":"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\u2013445."},{"key":"9402_CR36","unstructured":"Baeza-Yates R, Ribeiro-Neto B. Modern Information Retrieval. ACM Press\/Addison-Wesley, 1999."},{"key":"9402_CR37","unstructured":"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\u2013600."},{"issue":"2","key":"9402_CR38","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G Graefe","year":"1993","unstructured":"Graefe G. Query evaluation techniques for large databases. ACM Computing Surveys, 1993, 25(2): 73\u2013170.","journal-title":"ACM Computing Surveys"},{"key":"9402_CR39","doi-asserted-by":"crossref","unstructured":"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\u2013370.","DOI":"10.1145\/1007568.1007609"},{"key":"9402_CR40","unstructured":"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\u2013505."},{"key":"9402_CR41","doi-asserted-by":"crossref","unstructured":"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\u2013694.","DOI":"10.1145\/1142473.1142549"},{"key":"9402_CR42","unstructured":"Developmental therapeutics program. NCI\/NIH. http:\/\/dtp.nci.nih.gov\/ ."},{"key":"9402_CR43","doi-asserted-by":"crossref","unstructured":"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\u2013320.","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"2","key":"9402_CR44","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1108\/17440081011053104","volume":"6","author":"S Sakr","year":"2010","unstructured":"Sakr S, Al-Naymat G. Graph indexing and querying: A review. International Journal of Web Information Systems (IJWIS), 2010, 6(2): 101\u2013120.","journal-title":"International Journal of Web Information Systems (IJWIS)"},{"key":"9402_CR45","doi-asserted-by":"crossref","unstructured":"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\u2013137.","DOI":"10.1007\/978-3-642-00887-0_11"},{"key":"9402_CR46","unstructured":"Zhao P, Yu J, Yu P. Graph indexing: Tree + delta \u2265 graph. In Proc. the 33rd Int. Conf. Very Large Data Bases (VLDB), Vienna, Austria, Sept. 23-27, 2007, pp.938\u2013949."},{"key":"9402_CR47","unstructured":"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\u201352."},{"key":"9402_CR48","doi-asserted-by":"crossref","unstructured":"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\u201357.","DOI":"10.1145\/971697.602266"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9402-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-010-9402-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9402-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T14:53:49Z","timestamp":1740668029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-010-9402-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s11390-010-9402-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2010,11]]}}}