Abstract
Whenever mobile ad-hoc networks are used as a large data storage, a huge number of queries requesting the same information again and again can slow down the network and drain battery power. In this paper, we introduce an example application, the query classes that are required to be supported, and show up two possible caching methods. The two caching methods are based on the concept of query shipping and data shipping, respectively. Since our caching strategies can be used simultaneously, the decision for doing data shipping depends among other aspects on the overhead of transferred data. We explain why an XML Query Result Size Estimator can assist the application in the question of which mechanism should be used for a certain query, and point to other related estimation techniques.
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
Mandhani, B., Suciu, D.: Query caching and view selection for xml databases. In: VLDB 2005: Proceedings of the 31st international conference on Very large data bases, VLDB Endowment, pp. 469–480 (2005)
Ioannidis, Y.E.: The History of Histograms (abridged). In: VLDB 2003, Proceedings of 29th Intl. Conference on Very Large Data Bases, September 9-12, Berlin, Germany, pp. 19–30 (2003)
Polyzotis, N., Garofalakis, M.: Statistical Synopses for Graph-Structured XML Databases. In: SIGMOD 2002. Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp. 358–369. ACM Press, New York (2002)
Polyzotis, N., Garofalakis, M.N.: Structure and Value Synopses for XML Data Graphs. In: VLDB 2002: Proceedings of 28th Intl. Conference on Very Large Data Bases, pp. 466–477 (2002)
Drukh, N., Polyzotis, N., Garofalakis, M.N., Matias, Y.: Fractional XSketch Synopses for XML Databases. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds.) XSym 2004. LNCS, vol. 3186, pp. 189–203. Springer, Heidelberg (2004)
Aboulnaga, A., Alameldeen, A.R., Naughton, J.F.: Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. In: VLDB 2001. Proceedings of the 27th International Conference on Very Large Data Bases, pp. 591–600. Morgan Kaufmann, San Francisco (2001)
Jagadish, H.V., Ng, R.T., Srivastava, D.: Substring Selectivity Estimation. In: PODS 1999. Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 249–260. ACM Press, New York (1999)
McHugh, J., Widom, J.: Query Optimization for XML. In: Atkinson, M.P., Orlowska, M.E., Valduriez, P., Zdonik, S.B., Brodie, M.L. (eds.) VLDB 1999. Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pp. 315–326. Morgan Kaufmann, San Francisco (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böttcher, S., Obermeier, S., Wycisk, T. (2007). XML Query Result Size Estimation for Small Bandwidth Devices. In: Cooper, R., Kennedy, J. (eds) Data Management. Data, Data Everywhere. BNCOD 2007. Lecture Notes in Computer Science, vol 4587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73390-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73390-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73389-8
Online ISBN: 978-3-540-73390-4
eBook Packages: Computer ScienceComputer Science (R0)