Abstract
Path constraints have been studied for semistructured data modeled as a rooted edge-labeled directed graph [4], [11]-[13]. In this model, the implication problems associated with many natural path constraints are undecidable [11], [13]. A variant of the graph model, called the deter- ministic data model, was recently proposed in [10]. In this model, data is represented as a graph with deterministic edge relations, i.e., the edges emanating from any node in the graph have distinct labels. This model is more appropriate for representing, e.g., ACeDB [27] databases and Web sites. This paper investigates path constraints for the deterministic data model. It demonstrates the application of path constraints to, among others, query optimization. Three classes of path constraints are consid- ered: the language P c introduced in [11], an extension of P c , denoted by P w c , by including wildcards in path expressions, and a generalization of P w c , denoted by P * c , by representing paths as regular expressions. The implication problems for these constraint languages are studied in the context of the deterministic data model. It is shown that in contrast to the undecidability result of [11], the implication and finite implication problems for Pc are decidable in cubic-time and are finitely axiomatiz- able. Moreover, the implication problems are decidable for P w c . However, the implication problems for P * c are undecidable
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul. “Querying semi-structured data”. In Proc. 6th Int’l. Conf. on Database Theory (ICDT’97), 1997.
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesly, 1995.
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Weiner. “The lorel query language for semistructured data”. J. Digital Libraries, 1(1), 1997.
S. Abiteboul and V. Vianu. “Regular path queries with constraints”. In Proc. 16th ACM Symp. on Principles of Database Systems (PODS’97), 1997.
C. Beeri and M. Y. Vardi. “Formal systems for tuple and equality generating dependencies”. SIAM J. Comput., 13(1): 76–98, 1984.
T. Bray, C. Frankston, and A. Malhotra. “Document Content Description for XML”. W3C Note, 1998. http://www.w3.org/TR/NOTE-dcd.
T. Bray, J. Paoli, and C. M. Sperberg-McQueen. “Extensible Markup Language (XML) 1.0”. W3C Recommendation, 1998. http://www.w3.org/TR/REC-xml.
P. Buneman. “Semistructured data”. Tutorial in Proc. 16th ACM Symp. on Principles of Database Systems (PODS’97), 1997.
P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. “A query language and optimization techniques for unstructured data”. In Proc. ACM SIGMOD Int’l. Conf. on Management of Data, 1996.
P. Buneman, A. Deutsch, and W. Tan. “A deterministic model for semi-structured data”. In Proc. Workshop on Query Processing for Semistructured Data and Non-Standard Data Formats, 1999.
P. Buneman, W. Fan, and S. Weinstein. “Path constraints on semistructured and structured data”. In Proc. 17th ACM Symp. on Principles of Database Systems (PODS’98), 1998.
P. Buneman, W. Fan, and S. Weinstein. “Interaction between path and type constraints”. In Proc. 18th ACM Symp. on Principles of Database Systems (PODS’99), 1999.
P. Buneman, W. Fan, and S. Weinstein. “Path constraints in semistructured databases”. To appear in J. Comput. System Sci. (JCSS).
P. Buneman, W. Fan, and S. Weinstein. “Path constraints on deterministic graphs”. Technical report MS-CIS-98-33, CIS, University of Pennsylvania, 1998.ftp://ftp.cis.upenn.edu/pub/papers/db-research/tr9833.ps.gz.
D. Calvanese, G. DeGiacomo, and M. Lenzerini. “What can knowledge representation do for semi-structured data?” In Proc. 15th National Conf. on Artificial Intelligence (AAAI/IAAI’98), 1998.
D. Calvanese, G. DeGiacomo, M. Lenzerini, and D. Nardi. “Reasoning in expressive description logics”. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier, 1999.
A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. “XML-QL: a query language for XML”. W3C Note, 1998. http://www.w3.org/TR/NOTE-xml-ql.
H. B. Enderton. A mathematical introduction to logic. Academic Press, 1972.
M. Fuchs, M. Maloney, and A. Milowski. “Schema for object-oriented XML”. W3C Note, 1998. http://www.w3.org/TR/NOTE-SOX.
D. Harel. “Dynamic logic’. In D. M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic. II: Extensions of Classical Logic. D. Reidel Publ. Co., 1984.
O. Lassila and R. R. Swick. “Resource Description Framework (RDF) model and syntax speci_cation”. W3C Working Draft, 1998. http://www.w3.org/TR/WD-rdf-syntax.
A. Layman, E. Jung, E. Maler, H. S. Thompson, J. Paoli, J. Tigue, N. H. Mikula, and S. De Rose. “XML-Data”. W3C Note, 1998. http://www.w3.org/TR/http://www.w3.org/TR/
E. Maler and S. De Rose. “XML Linking language (XLink)”. W3C Working Draft, 1998. http://www.w3.org/TR/WD-xlink.
A. O. Mendelzon, G. A. Mihaila, and T. Milo. “Querying the World Wide Web”. J. Digital Libraries, 1(1), 1997.
L. Popa and V. Tannen. “An equational chase for path-conjunctive queries, constraints, and views”. In Proc. of 7th Int.’l Conf. on Database Theory (ICDT’99), 1999.
W. C. Rounds. “Feature logics”. In J. vanBenthem and A. ter Meulen, editors, Handbook of Logic and Language. Elsevier, 1997.
J. Thierry-Mieg and R. Durbin. “Syntactic definitions for the ACEDB data base manager”. Technical Report MRC-LMB xx.92, MRC Laboratory for Molecular Biology, Cambridge, CB2 2QH, UK, 1992.
M. Y. Vardi and P. Wolper. “Automata-theoretic techniques for modal logic of programs”. J. Comput. System Sci. (JCSS), 32(2), 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buneman, P., Fan, W., Weinstein, S. (2000). Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model. In: Connor, R., Mendelzon, A. (eds) Research Issues in Structured and Semistructured Database Programming. DBPL 1999. Lecture Notes in Computer Science, vol 1949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44543-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-44543-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41481-0
Online ISBN: 978-3-540-44543-2
eBook Packages: Springer Book Archive