Sciweavers

552 search results - page 29 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
PVLDB
2010
190views more  PVLDB 2010»
14 years 6 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
WWW
2008
ACM
16 years 13 days ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
16 years 1 months ago
Processing Event-Monitoring Queries in Sensor Networks
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Vassilis Stoumpos, Antonios Deligiannakis, Yannis ...
MOBIHOC
2008
ACM
15 years 11 months ago
Collaborative query processing among heterogeneous sensor networks
Demands on better interacting with physical world require an effective and comprehensive collaboration mechanism among multiple heterogeneous sensor networks. Previous works mainl...
Yuan He, Mo Li, Yunhao Liu
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 1 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu