Abstract
TQL is a query language for semi-structured data. TQL binding mechanism is based upon the ambient logic. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being based on a logic which includes “difficult” operators such as negation, universal quantification, recursion, and new tree-related operators. In [6] an “implementation model” is presented, here we first extend it with tree operations, hence obtaining an algebra for the full TQL language. Then we shortly describe the evaluation techniques that we exploit in the actual implementation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
D. Beech, A. Malhotra, and M. Rys. A formal data model and algebra for XML. Communication to the W3C, September 1999.
Catriel Beeri and Yariv Tzaban. SAL: An algebra for semistructured data and XML. In WebDB (Informal Proceedings), pages 37–42, 1999.
P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Keys for XML. In Proc. of International World Wide Web Conference,WWW10,May 2001.
L. Cardelli. Describing semistructured data. SIGMOD Record, Database Principles Column, 2002. To appear.
L. Cardelli and G. Ghelli. A query language based on the ambient logic. In Proc. of European Symposium on Programming (ESOP), Genova, Italy, April 2001.
L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proc. of POPL. ACM Press, 2000.
S. Cluet, C. Delobel, J. Siméon, and K. Smaga. Your mediators need data conversion. In Proc. of ACM SIGMOD, 1998.
G. Conforti, O. Ferrara, and G. Ghelli. TQL Algebra and its Implementation. Working Draft available at http://tql.di.unipi.it/tql. Full version.
G. Conforti, G. Ghelli, A. Albano, D. Colazzo, P. Manghi, and C. Sartiani. The Query Language TQL. In Proc. of WebDB, 2002. To appear.
P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Siméon, and P. Wadler. XQuery 1. 0 Formal Semantics, June 2001. W3C Working Draft.
B.C. Pierce H. Hosoya. XDuce: A typed XML processing language (preliminary report). In Proc. of Workshop on the Web and Data Bases (WebDB), 2000.
H. V. Jagadish, L. V. S. Lakshmanan, D. Srivastava, and K. Thompson. TAX: A Tree Algebra for XML. In Proceedings of DBPL’01, 2001.
P. Kanellakis. Tutorial: Constraint programming and database languages. In Proc. of the 14th PODS, pages 46–53. ACM Press, 1995.
Peter Z. Revesz. Safe query languages for constraint databases. ACM Transactions on Database Systems, 23 (1): 58–99, March 1998.
C. Sartiani and A. Albano. Yet another query algebra for XML data. In Proc. of IEEE IDEAS, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Conforti, G., Ferrara, O., Ghelli, G. (2002). TQL Algebra and Its Implementation. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_35
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive