TOWARDS COMPACT OPERATOR TREES FOR QUERY INDEXING

Hagen Höpfner, Erik Buchmann

Abstract

Application areas like semantic caches or update relevancy checks require query based indexing: They use an algebra representation of the query tree to identify reusable fragments of former query results. This requires compact query representations, where semantically equivalent (sub-)queries are expressed with identical terms. It is challenging to obtain such query representations: Attributes and relations can be renamed, there are numerous ways to formulate equivalent selection predicates, and query languages like SQL allow a wide range of alternatives for joins and nested queries. In this paper we present our first steps towards optimizing SQL-based query trees for indexing. In particular, we use both existing equivalence rules and new transformations to normalize the sub-tree structure of query trees. We optimize selection and join predicates, and we present an approach to obtain generic names for attributes and table aliases. Finally, we discuss the benefits and limitations of our intermediate results and give directions for future research.

References

  1. Biswas, N. N. (1984). Computer aided minimization procedure for boolean functions. In Proceedings of the 21st conference on Design automation.
  2. Dayal, U., Goodman, N., and Katz, R. H. (1982). An extended relational algebra with control over duplicate elimination. In Proceedings of the SIGACT-SIGMOD Symposium on Principles of Database Systems.
  3. Elmasri, R. and Navathe, S. B. (2007). Fundamentals of Database Systems. Addison Wesley.
  4. Gray, J., Helland, P., O'Neil, P., and Shasha, D. (1996). The Dangers of Replication and a Solution. SIGMOD Record, 25(2):173-182.
  5. Grefen, P. W. and de By, R. A. (1994). A multi-set extended relational algebra: a formal approach to apractical issue. In Proceedings of the 10th ICDE.
  6. Gupta, A., Harinarayan, V., and Quass, D. (1995). Aggregate-Query Processing in Data Warehousing Environments. In Proceedings of the 21st VLDB.
  7. Höpfner, H. (2007). Query Based Client Indexing in Client/Server Information Systems. Journal of Computer Science, 3(10):773-779.
  8. Höpfner, H. and Sattler, K.-U. (2003). Towards Trie-Based Query Caching in Mobile DBS. In Proceedings of the Workshop Scalability, Persistence, Transactions - Database Mechanisms for Mobile Applications.
  9. Karnaugh, M. (1953). The Map Method for Synthesis of Combinational Logic Circuits. Transactions of American Institute of Electrical Engineers, 72(7):593-599.
  10. Kuenning, G. H. and Popek, G. J. (1997). Automated Hoarding for Mobile Computers. ACM SIGOPS Operating Systems Review, 31(5):264-275.
  11. Lee, K. C. K., Leong, H. V., and Si, A. (1999). Semantic query caching in a mobile environment. ACM SIGMOBILE Mobile Computing and Communications Review, 3(2):28-36.
  12. McCluskey, E. J. (1956). Minimization of Boolean Functions. Bell System Techical Journal, 35(5):1417-1444.
  13. Quine, W. V. O. (1952). The problem of Simplifying Truth functions. American Mathematics Monthly, 59(8):521-531.
  14. Rivest, R. L. (1992). The MD5 Message-Digest Algorithm. Informational Errata. http://tools.ietf. org/html/rfc1321.
  15. Russell, S. J. and Norvig, P. (2002). Artificial Intelligence: A Modern Approach.
Download


Paper Citation


in Harvard Style

Höpfner H. and Buchmann E. (2008). TOWARDS COMPACT OPERATOR TREES FOR QUERY INDEXING . In Proceedings of the Third International Conference on Software and Data Technologies - Volume 3: ICSOFT, ISBN 978-989-8111-53-1, pages 174-179. DOI: 10.5220/0001888001740179


in Bibtex Style

@conference{icsoft08,
author={Hagen Höpfner and Erik Buchmann},
title={TOWARDS COMPACT OPERATOR TREES FOR QUERY INDEXING},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 3: ICSOFT,},
year={2008},
pages={174-179},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001888001740179},
isbn={978-989-8111-53-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 3: ICSOFT,
TI - TOWARDS COMPACT OPERATOR TREES FOR QUERY INDEXING
SN - 978-989-8111-53-1
AU - Höpfner H.
AU - Buchmann E.
PY - 2008
SP - 174
EP - 179
DO - 10.5220/0001888001740179