Abstract
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 approximate containment, and its variants k-containment and reliable containment. 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.
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
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and Xml. Morgan Kaufmann Pulishers, San Francisco (1999)
Aho, A., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Calvanese, D., Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of Regular Expressions and Regular Path Queries. In: Proc. PODS 1999, pp. 194–204 (1999)
Calvanese, D., Giacomo, G., Lenzerini, M., Vardi, M.Y.: View-Based Query Processing and Constraint Satisfaction. In: Proc. LICS 2000, pp. 361–371 (2000)
Grahne, G., Thomo, A.: An Optimization Technique for Answering Regular Path Queries. In: Suciu, D., Vossen, G. (eds.) WebDB 2000. LNCS, vol. 1997, pp. 99–104. Springer, Heidelberg (2001)
Grahne, G., Thomo, A.: Algebraic rewritings for optimizing regular path queries. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 303–315. Springer, Heidelberg (2000)
Hashiguchi, K.: Limitedness Theorem on Finite Automata with Distance Functions. J. Comp. Syst. Sci. 24(2), 233–244 (1982)
Hashiguchi, K.: Improved Limitedness Theorems on Finite Automata with Distance Functions. Theoretical Computer Science 72(1), 27–38 (1990)
Hashiguchi, K.: New upper bounds to the limitedness of distance automata. Theoretical Computer Science 233(1-2), 19–32 (2000)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Hunt III, H.B., Rosenkrantz, D.J., Szymanski, T.G.: On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. J. Comp. Syst. Sci. 12(2), 222–268 (1976)
Kruskal, J.: An Overview of Sequence Comparison. In: Sankoff, D., Kruskal, J. (eds.) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pp. 1–44. Addison-Wesley, Reading (1983)
Jagadish, H.V., Mendelzon, A.O., Milo, T.: Similarity-Based Queries. In: Proc. PODS 1995, pp. 36–45 (1995)
Leung, H.: Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. Theoretical Computer Science 81(1), 137–145 (1991)
Mendelzon, A.O., Wood, P.T.: Finding Regular Simple Paths in Graph Databases. SIAM J. Comp. 24(6), 1235–1258 (1995)
Mendelzon, A.O., Mihaila, G.A., Milo, T.: Querying the World Wide Web. Int. J. Dig. Lib. 1(1), 57–67 (1997)
Pin, J.E.: Tropical Semirings. In: Gunawardena, J. (ed.) Idempotency, pp. 50–69. Cambridge University Press, Cambridge (1998)
Simon, I.: On Semigroups of Matrices over the Tropical Semiring. Informatique Theorique et Applications 28(3-4), 277–294 (1994)
Wagner, R.A., Fischer, M.J.: The String-to-String Correction Problem. J. ACM 21(1), 168–173 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grahne, G., Thomo, A. (2004). Query Answering and Containment for Regular Path Queries under Distortions. In: Seipel, D., Turull-Torres, J.M. (eds) Foundations of Information and Knowledge Systems. FoIKS 2004. Lecture Notes in Computer Science, vol 2942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24627-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24627-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20965-2
Online ISBN: 978-3-540-24627-5
eBook Packages: Springer Book Archive