We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the query languages for semistructured databases. To enable approximations, we allow the regular path queries to be distorted. The distortions are expressed in the system by using weighted regular expressions, which correspond to weighted regular transducers. After defining the notion of weighted approximate answers we show how to compute them in order of their proximity to the query. In the new approximate setting, query containment has to be redefined in order to take into account the quantitative proximity information in the query answers. For this, we define the approximate containment, and its variants k-containment and reliable contain-ment. Then, we give an optimal algorithm for deciding the k-containment. Regarding the reliable approximate containment, we show that it is polynomial time equivalent to the notorious limitedness problem in distance automata.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Abiteboul, P. Buneman and D. Suciu, Data on the Web: From Relations to Semistructured Data and XML (Morgan Kaufmann Publishers, San Francisco, California, 1999).
S. Abiteboul and V. Vianu, Regular path queries with constraints, Journal of Computer and System Sciences 58(3) (1999) 428–452.
A. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison–Wesley, Reading, Massachusetts, 1974).
P. Buneman, F. Wenfei and S. Weinstein, Path constraints in semistructured and structured databases, in: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '98), (ACM, 1998) pp. 129–138.
D. Calvanese, G. Giacomo, M. Lenzerini and M.Y. Vardi, Rewriting of regular expressions and regular path queries. in: Proceedings of the Eighteenth ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems (PODS '99) (ACM, 1999) pp. 194–204.
D. Calvanese, G. Giacomo, M. Lenzerini and M.Y. Vardi, View-based query processing and constraint satisfaction, in: Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science (LICS '00) (IEEE Computer Society, 2000) pp. 361–371.
G. Grahne and A. Thomo, An optimization technique for answering regular path queries. Third International Workshop on The World Wide Web and Databases (WebDB '00), Selected Papers in Lecture Notes in Computer Science 1997:99–104, Springer, 2001.
G. Grahne and A. Thomo, Algebraic rewritings for optimizing regular path queries. in: Proceedings of the Eighth International Conference on Database Theory (ICDT '01), Lecture Notes in Computer Science 1973 (Springer, 2001) pp. 303–315.
H.V. Jagadish, A.O. Mendelzon and T. Milo, Similarity-based queries, in: Proceedings of the Fourteenth ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems (PODS '95) (ACM, 1995) pp. 36–45.
H.J. Johnson, Rational equivalence relations, Theoretical Computer Science 47(1) (1986) 39–60.
K. Hashiguchi, Limitedness theorem on finite automata with distance functions, Journal of Computer and System Sciences 24(2) (1982) 233–244.
K. Hashiguchi, Improved limitedness theorems on finite automata with distance functions, Theoretical Computer Science 72(1) (1990) 27–38.
K. Hashiguchi, New upper bounds to the limitedness of distance automata, Theoretical Computer Science 233(1–2) (2000) 19–32.
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison–Wesley Publishing Company, Reading, Massachusetts, 1979).
H.B. Hunt III, D.J. Rosenkrantz and T.G. Szymanski, On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences 12(2) (1976) 222–268.
J. Kruskal, An overview of sequence comparison, in: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, eds. D. Sankoff and J. Kruskal (Addison–Wesley Publishing Company, Reading, Massachusetts, 1983) pp. 1–44.
H. Leung, Limitedness theorem on finite automata with distance functions: An algebraic proof, Theoretical Computer Science 81(1) (1991) 137–145.
A.O. Mendelzon and P.T. Wood, Finding regular simple paths in graph databases, SIAM Journal on Computing 24(6) (1995) 1235–1258.
A.O. Mendelzon, G.A. Mihaila and T. Milo, Querying the world wide web. International Journal on Digital Libraries 1(1) (1997) 57–67.
J.E. Pin, Tropical semirings, in: Idempotency, ed. J. Gunawardena (Cambridge University Press, 1998) pp. 50–69.
I. Simon, On semigroups of matrices over the tropical semiring, Informatique Theorique et Applications 28(3–4) (1994) 277–294.
M. Sipser, Introduction to the Theory of Computation (PWS Publishing Company, 1996).
M.Y. Vardi, A call to regularity, in: Proceedings of PCK50 – Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop '03 (2003) p. 11.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grahne, G., Thomo, A. Regular path queries under approximate semantics. Ann Math Artif Intell 46, 165–190 (2006). https://doi.org/10.1007/s10472-005-9016-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-005-9016-8