Substring selectivity estimation
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Statistical synopses for graph-structured XML databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Estimating the Selectivity of XML Path Expressions for Internet Scale Applications
Proceedings of the 27th International Conference on Very Large Data Bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Structure and value synopses for XML data graphs
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The history of histograms (abridged)
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On an Enhancement of XML Applied for Mobile E-Commerce
Journal of Electronic Commerce in Organizations
Hi-index | 0.00 |
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.