Sciweavers

JPDC
2010
128views more  JPDC 2010»
13 years 2 months ago
Adaptive holistic scheduling for query processing in sensor networks
We observe two deficiencies of current query processing and scheduling techniques for sensor networks: (1) A query execution plan does not adapt to the hardware characteristics o...
Hejun Wu, Qiong Luo
SIGIR
2008
ACM
13 years 2 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...
ISEMANTICS
2010
13 years 2 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
CIKM
2010
Springer
13 years 2 months ago
Preference query evaluation over expensive attributes
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
CIKM
2010
Springer
13 years 2 months ago
Structural annotation of search queries using pseudo-relevance feedback
Marking up queries with annotations such as part-of-speech tags, capitalization, and segmentation, is an important part of many approaches to query processing and understanding. D...
Michael Bendersky, W. Bruce Croft, David A. Smith
PVLDB
2008
174views more  PVLDB 2008»
13 years 3 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 4 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
NGC
2000
Springer
101views Communications» more  NGC 2000»
13 years 4 months ago
Information Access in Multimedia Databases Based on Feature Models
With the increasing popularity of the WWW, the main challenge in computer science has become content-based retrieval of multimedia objects. Access to multimedia objects in database...
Arjen P. de Vries, Menzo Windhouwer, Peter M. G. A...
DEBU
2000
147views more  DEBU 2000»
13 years 4 months ago
XJoin: A Reactively-Scheduled Pipelined Join Operator
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imb...
Tolga Urhan, Michael J. Franklin
TMC
2008
112views more  TMC 2008»
13 years 4 months ago
Location-Based Spatial Query Processing in Wireless Broadcast Environments
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the...
Wei-Shinn Ku, Roger Zimmermann, Haixun Wang