Abstract—This paper examines the following wireless data access scenario: a number of clients are interested in a set of data items kept at the server. A client sends a query req...
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
“W3QL: A Query Language for the WWW”, published in 1995, presented a language with several distinctive features. Employing existing indexes as access paths, it allowed the sel...
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
Kanda Runapongsa, Jignesh M. Patel, Rajesh Bordawe...