Compact reachability labeling for graph-structured data

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 594-601

  He, Hao ^a   Wang, Haixun ^b   Yang, Jun ^a   Yu, Philip S ^b  

^a DUKE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Graph reachability labeling

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; ENCODING (SYMBOLS); INFORMATION MANAGEMENT; MATRIX ALGEBRA; QUERY LANGUAGES; TREES (MATHEMATICS); XML;

GRAPH REACHABILITY LABELING; ONTOLOGY DATABASE; TREE SUBSTRUCTURES; XML QUERY PROCESSING;

KNOWLEDGE REPRESENTATION;

EID: 33745782353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099708     Document Type: Conference Paper

References (20)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In Proc. of the 1989 ACM SIGMOD Intl. Conf. on Management of Data, 1989.
2. H. Ait-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Trans. Program. Lang. Syst., 11(1):115-146, 1989.
3. S. Al-Khalifa, H. V. Jagadish, J. M. Patel, Y. Wu, N. Koudas, and D. Srivastava. Structural joins: A primitive for efficient XML query pattern matching. In Proc. of the 2002 Intl. Conf. on Data Engineering, pages 141-154, 2002.
4. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In Proc. of the 2002 ACM SIGMOD, 2002.
5. Y. Caseau. Efficient handling of multiple inheritance hierarchies. In Proc. of the 1993 Conf. on Object-oriented Programming Systems, Languages, and Applications, 1993.
6. Online Computer Library Center. Dewey decimal classification. http://www.oclc.org/dewey/.
7. Q. Chen, A. Lim, and K. W. Ong. D(k)-index: An adaptive structural summary for graph-structured data. In Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data, June 2003.
8. V. Christophides, D. Plexousakis, and et al. On labeling schemes for the semantic web. In Proc. of the 12th Intl. Conf. on WWW, 2003.
9. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of the 13th ACM-SIAM SODA, 2002.
10. P. F. Dietz. Maintaining order in a linked list. In Proceedings of the 14th ACM symposium on Theory of computing, 1982.
11. Frank Olken et al. The Biopathways Graph Data Manager project. http://pueblo.lbl.gov/~olken/graphdm/graphdm.htm.
12. H. He, H. Wang, J. Yang, and Philip S. Yu. Compact reachability labeling for graph-structured data. Technical report, Duke University, Nov. 2004. http://www.cs.duke.edu/~haohe/research/report.pdf.
13. T. Kameda. On the vector representation of the reachability in planar directed graphs. Information Processing Letters, 3(3), January 1975.
14. M. Katz, N. A. Katz, and et al. Labeling schemes for flow and connectivity. In Proc. of the 13th ACM-SIAM SODA, 2002.
15. R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data, June 2002.
16. N. Polyzotis and M. N. Garofalakis. Structure and value synopses for XML data graphs. In Proc. of the 28th VLDB, pages 466-477, 2002.
17. A. Sayed and R. Unland. Hid: An efficient path index for complex xml collections with arbitrary links. In DNIS, pages 78-91, 2005.
18. SRI. The BioCyc project, http://biocyc.org/.
19. Z. Vagena, M. Moro, and V. Tsotras. Twig query processing over graph-structured XML data. In Proc. of the 7th Intl. Workshop on Web and Databases, 2004.
20. C. Zhang, J. Naughton, and et al. On supporting containment queries in relational database management systems. In Proc. of the 2001 ACM SIGMOD Intl. Conf. on Management of Data, 2001.