Fast and efficient computation of reachability queries over linked XML documents' graphs

International Journal of Web Information Systems

Volumn 5, Issue 1, 2009, Pages 56-76

  Sayed, Awny ^a  

^a MINIA UNIVERSITY   (Egypt)

Author keywords

Databases; Extensible markup language; Query Languages

Indexed keywords

DATABASE RESEARCH; DESCENDANTS-OR-SELF QUERIES; DIRECTED ACYCLIC GRAPH (DAG); EFFICIENT COMPUTATION; GRAPH-STRUCTURED DATUM; LINK RELATIONSHIPS; REACHABILITY QUERIES; STRUCTURED INDEXES;

ALGORITHMS; DATABASE SYSTEMS; GRAPHIC METHODS; QUERY LANGUAGES; QUERY PROCESSING; XML;

GRAPH THEORY;

EID: 84886413438     PISSN: 17440084     EISSN: None     Source Type: Journal    
DOI: 10.1108/17440080910947312     Document Type: Article

References (30)

1. Chein, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J. and Zaniolo, C. (2002), "Efficient structural joins on indexed XML documents,", paper presented at 28th International Conference on Very Large Data Bases (VLDB).
2. Cheng, J., Xu Y.u., J., Lin, X. and Yu, S. (2006), "Fast computation of reachability labeling for large graphs,", paper presented at Extended Database Technology 2006, Munich.
3. Chung, C., Min, J. and Shim, K. (2002), "APEX: an adaptive path index for XML data,", ACM SIGMOD Conference, pp. 121-32. (Pubitemid 34985541)
4. Cohen, E., Kapaln, H. and Milo, T. (2002), "Labeling dynamic XML trees,", Symposium on Principle of Databases (POSD), ACM, pp. 271-81. (Pubitemid 35009500)
5. Cohen, E., Halperin, E., Kaplan, H. and Zwick, U. (2002), "Reachability and distance queries via 2-hop labels,", Proceedings of Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York, NY, pp. 937-46.
6. Cooper, F., Sample, N., Franklin, J., Hjaltason, R. and Shadmon, M. (2001), "A fast index for semistructured data,", VLDB, Proceedings of 27th International Conference on Very Large Data Bases, Morgan Kaufmann, Romè, September 11-14.
7. Cormen, H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2001), Introduction to Algorithms, Ch. 22-23, 2nd ed., MIT Press, Cambridge, MA.
8. Goldman, R. and Widom, J. (1997), "DataGuides: enabling query formulation and optimization in semistructured databases,", in Jarke, M., Carey, M.J., Dittrich, K.R., Lochovsky, F.H., Loucopoulos, P. and Jeusfeld, M.A. (Eds), VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, Morgan Kaufmann, Athens, August 25-29, pp. 436-45.
9. Kaplan, H., Milo, T. and Shabo, R. (2002), "A comparison of labeling schemes for ancestor queries,", 13th ACM - SIAM Symposium on Discrete Algorithms (SODA), pp. 954-63.
10. Kaushik, R., Bohnannon, P., Naugthon, J.F. and Korth, H.F. (2001), "Compact labeling schemes for ancestor's queries,", 12th ACM - SIAM Symposium on Discrete Algorithms (SODA), pp. 547-56.
11. Kaushik, R., Bohnannon, P., Naugthon, J.F. and Korth, H.F. (2002), "Covering indexes for Branching path queries,", ACM SIGMOD Conference on Management of Data, ACM, pp. 133-44. (Pubitemid 34985542)
12. Kaushik, R., Shoney, P., Bohannon, P. and Gudes, E. (2002), "Exploiting local similarity for indexing paths in graph-structured data,", 18th International Conference on Data Engineering (ICDE).
13. Li, Q. and Moon, L. (2001), "Indexing and querying XML data for regular path expressions,", 27th Conference on Very Large Data Bases Int. (VLDB), pp. 361-70.
14. Milo, T. and Suciu, D. (1999), "Index structures for path expressions,", 7th International Conference on Database Theory (ICDT), pp. 277-95.
15. Nuutila, E. and Soisalon-Soininen (1993), "Efficient transitive closure computation,", Technical Report TKO-B113, Laboratory of Information Processing Science, Helsinki University of Technology, Helsinki.
16. Qun, C., Lim, A. and Win-Ong, K. (2003), "D(K)-index: an adaptive structural summary for graph-based data,", ACM SIGMOD International Conference on Management of Data, ACM, pp. 134-44.
17. Schenkel, R. and Weikum, G. (2004), "HOPI: an efficient connection index for complex XML document collections,", 9th International Conference on Extending Database Technology (EDBT), pp. 237-55.
18. Tatarinov, S. and Zhang, C. (2002), "Storing and querying ordered XML using a relational database system,", ACM SIGMOD International Conference on Management of Data, ACM, pp. 204-15. (Pubitemid 34985548)
19. Trussl, S. and Leser, U. (2007), "Fast and practical indexing and querying of very large graphs,", paper presented at SIGMOD 2007, Beijing.
20. Wang, H., He, H., Yang, J., Philip Yu, S. and Jeffrey Yu, X. (2006), "Dual labeling: answering graph reachability queries in constant time,", paper presented at ICDL 2006, Atlanta, GA.
21. XML Linking Language (2001), "Version 1.0, W3C recommendation, ", available at: www.W3.org/TR/xlink (accessed June 27, 2001).
22. XML Pointer Language (2002), "W3C working draft,", available at: www.w3.org/TR/xptr (accessed August 16, 2002).
23. Yoshikawa, M. and Amagasa, T. (2001), "XRel: a path-index based approach to storage and retrivel XML documents using relational databases,", ACM Transactions on Internet Technology (TOIT), Vol. 1 No. 2, pp. 110-41.
24. Zhang, C., Naughton, J., De Witt, D., Luo, Q. and Lohman, G. (2001), "On supporting containment queries in relational database management system,", paper presented at ACM SIGMOD International Conference on Management of Data, ACM.
25. Abiteboul, S., Bunmen, P. and Suciu, D. (1999), Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, Los Altos, CA.
26. Barashev, D. (2002), "Indexing XML to support path expressions,", 6th East-European Conference on Advances in Databases and Infromation System (ADBIS).
27. Kaplan, H. and Milo, T. (2001), "Short and simple lables schemes for small distances and other functions,", 7th International Workshop on Algorithms and Data Structures (WADS), pp. 246-57. (Pubitemid 33315651)
28. Sakr, S. (2008), "Algebraic-based XQuery cardinality estimation,", International Journal of Web Information Systems, Vol. 4 No. 1, pp. 7-46.
29. Sayed, A. and Unland, R. (2003), "Index-support on XML documents containing Links,", 46th Int. IEEE Midwest Symposium On Circuits and Systems, Cairo, December 27.
30. The XML bechmark project (n.d.), available at: www.xml-benchmark.org