Efficient algorithms for exact ranked twig-pattern matching over graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 581-593

  Gou, Gang ^a   Chirkova, Rada ^a  

^a North Carolina State University   (United States)

Author keywords

Graph; Top k; Twig pattern matching; XML

Indexed keywords

DYNAMIC POSITIONING; MARKUP LANGUAGES; PATTERN MATCHING;

COMPUTATIONAL OVERHEADS; DATA INPUTS; EFFICIENT ALGORITHMS; GRAPH; LARGE DATA SETS; LARGE GRAPHS; LINEAR TIMES; PERFORMANCE PROPERTIES; STRUCTURED DATUMS; TWIG PATTERN MATCHING; WORST CASES;

PERCOLATION (SOLID STATE);

EID: 57149142231     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376676     Document Type: Conference Paper

References (25)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. SIGMOD, 1989.
2. S, Agrawal, S. Chaudhuri, and G. Das. DBXplorcr: A system for keyword-based search over relational databases. ICDE, 2002.
3. M. D. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM: 29(10), 1986.
4. G, Bhalotia, A. Hulgeri, C. Nakhc, S. Chakrabarti, and S. Sudarshan, Keyword searching and browsing in databases using BANKS. ICDE, 2002.
5. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. SIGMOD, 2002.
6. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SODA, 2002.
7. S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A semantic search engine for XML. VLDB, 2003.
8. T. H. Gormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms (2nd edition). MIT Press, 2001.
9. B. Dawes and D. Abrahams. Boost C++ Libraries. http://www.boost.org/.
10. DBLP. DBLP bibliography. http://dblp.uni-trier.de/xml/.
11. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding top-k min-cost connected trees in databases. ICDE, 2007.
12. R. Fagin, A. Lotcm, and M. Naor. Optimal aggregation algorithms for middleware. PODS, 2001.
13. G. Gou and R. Chirkova. Efficiently querying large XML data repositories: a survey. IEEE Transactions on Knowledge and Data Engineering (TKDE), 2007.
14. L. Guo, F. Shao, C. Botev, and J. Shanmugasundarain. XRANK: Ranked kevword search over XML documents. SIGMOD, 2003.
15. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. SIGMOD, 1996.
16. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: ranked keyword searches on graphs. SIGMOD, 2007.
17. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. VLDB, 2002.
18. V. Kacholia., S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. VLDB, 2005.
19. W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing web pages by information unit. WWW, 2001.
20. Oracle. Oracle Berkeley DB Java Edition (Version 3.2.44). http://www.oracle,com/technology/products /berkeley-db /je/index, html.
21. Y. Qi, K. S. Candan, and M. L. Sapino. Sum-Max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs. VLDB, 2007.
22. G. Reich and P. Widmayer. Beyond Steiner's problem: A VLSI oriented generalization. WG Workshop, 1989.
23. W3C. XML path language (XPath) Version 1.0. http://www.w3.org/TR/ xpath, 1999.
24. W3C. Resource Description framework (RDF). http://www.w3.org/RDF/, 2004.
25. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. ICDE, 2006.