Sciweavers

5954 search results - page 582 / 1191
» Querying Bi-level Information
Sort
View
WOWMOM
2005
ACM
127views Multimedia» more  WOWMOM 2005»
16 years 25 days ago
Game Theoretic Power Aware Wireless Data Access
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...
Mark Kai Ho Yeung, Yu-Kwong Kwok
152
Voted
SPIRE
2005
Springer
16 years 23 days ago
Rank-Sensitive Data Structures
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 ...
Iwona Bialynicka-Birula, Roberto Grossi
235
Voted
SPIRE
2005
Springer
16 years 23 days ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
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...
Rodrigo Paredes, Edgar Chávez
VLDB
2005
ACM
119views Database» more  VLDB 2005»
16 years 23 days ago
Database-Inspired Search
“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...
David Konopnicki, Oded Shmueli
193
Voted
XSYM
2004
Springer
108views Database» more  XSYM 2004»
16 years 18 days ago
XIST: An XML Index Selection Tool
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...