Abstract
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formula of the temporal logic CTL. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Abiteboul. Querying semi-structured data. In Proc.of ICDT. Vol. 1186 of LNCS, pp. 1–18, 1997.
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. Int’l J. on Digital Libraries, 1(1):68–88, 1997.
P. Buneman, S. B. Davidson, G. G. Hillebrand, and D. Suciu. A Query Language and Optimization Techniques for Unstructured Data.In Proc. of the 1996 ACM SIGMOD, pp. 505–516, 1996.
P. Buneman, S. B. Davidson, G. G. Hillebrand, and D. Suciu. Adding structure to unstructured data. In Proc. of Database Theory; 6th Int’l Conf., pp. 336–350, 1997.
P._J. Cameron. First-Order Logic. In L. W. Beineke and R. J. Wilson (Eds.): Graph Connections. Relationships Between Graph Theory and other Areas of Mathematics. Clarendon Press, 1997.
L. Cardelli and G. Ghelli. A query language for semistructured data based on the Ambient logic. In Proc. of ESOP 2001, Vol. 2028 of LNCS, pp. 1–22, 2001.
S. Ceri, S. Comai, E. Damiani, P. Fraternali, S. Paraboschi, and L. Tanca. XML-GL: a graphical language for querying and restructuring XML documents. Proc. of WWW8, Canada, 1999.
D. Chamberlin, J. Rubie, and D. Florescu. Quilt: An XML Query Language for Heterogeneous Data Sources. In Proc. of the World Wide Web and Databases, Third International Workshop WebDB 2000, Vol. 1997 of LNCS, pp. 1–25, 2001.
W. Chan. Temporal-logic Queries. In Proc. of 12th CAV. Vol. 1855 of LNCS, pp. 450–463. Chicago, USA, 2000.
A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. Proc. of 11th CAV. Vol. 1633 of LNCS, pp. 495–499, 1999.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent system using temporal logic specification. ACM TOPLAS, 8(2):244–263, 1986.
M. P. Consens and A. O. Mendelzon. GraphLog: a Visual Formalism for Real Life Recursion. In Proc. of the 9th ACM PODS’90, pp. 404–416, 1990.
A. Cortesi, A. Dovier, E. Quintarelli, and L. Tanca. Operational and Abstract Semantics of a Query Language for Semi-Structured Information. In Proc.of DDLP’98, pp. 127–139. GMD Report 22, 1998. Extended Version to appear in Theoretical Computer Science.
E. Damiani and L. Tanca. Blind Queries to XML Data. In Proc. of 11th International Conference, DEXA 2000, Vol. 1873 of LNCS, pp. 345–356, 2000.
L. de Alfaro. Model Checking the World Wide Web. In Proc. of 13th Conference on Computer Aided Verification, Vol. 2102 of LNCS, pp. 337–349, 2001.
A. Dovier and C. Piazza. The Subgraph Bisimulation Problem and its Complexity. Univ. di Udine, Dip. di Matematica e Informatica, RR 27/00, Nov. 2000.
A. Dovier and E. Quintarelli. Model-Checking Based Data Retrieval. Technical Report, Politecnico di Milano, May 2000 (http://www.elet.polimi.it/~quintare).
E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics. Elsevier, and MIT Press, 1990.
M. Fernandez, D. Florescu, A. Levy, and D. Suciu. A query language for a web-site management system. SIGMOD Record, 26(3):4–11, 1997.
P. C. Kannellakis and S. A. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86(1):43–68, 1990.
R. Milner. A Calculus of Communicating Systems. Vol. 92 of LNCS, 1980.
M. Müller-Olm, D. Schmidt, and B. Steffen. Model-checking. A tutorial introduction. In Proc. of SAS’99. Vol. 1694 of LNCS, pp. 330–354, 1999.
F. Neven and T. Schwentick. Query Automata. In Proc. of the 18th ACM SIGACT-SIGMOD-SIGART Symp. on Princ. of DBSystems, ACMPress,pp. 205–214, 1999.
F. Neven and T. Schwentick. Expressive and Efficient Pattern Languages for Tree-Structured Data. In Proc. of the 19th ACM SIGACT-SIGMOD-SIGART Symp. on Princ. of DB Systems, ACM Press, pp. 145–156, 2000.
R. Paige and R. E. Tarjan. Three Partition refinements algorithms. SIAM J. on Computing, 16(6):973–989, 1987.
Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object exchange across heterogeneous information sources. In Proc. of the 11th ICDE, pp. 251–260, 1995.
J. Paredaens, P. Peelman, and L. Tanca. G-Log: A Declarative Graphical Query Language. IEEE TKDE, 7(3):436–453, 1995.
D. Quass, A. Rajaraman, Y. Sagiv, J. Ullman, and J. Widom. Querying Semistructured Heterogeneus Information. In Proc. of DOOD’95, pp. 319–344, 1995.
WorldWide WebConsortium. XMLPath Language (XPath)version1.0. http://www.w3.org/TR/xpath.html, W3C Reccomendation, November 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dovier, A., Quintarelli, E. (2002). Model-Checking Based Data Retrieval. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-46093-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44080-2
Online ISBN: 978-3-540-46093-0
eBook Packages: Springer Book Archive