Sciweavers

1160 search results - page 97 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ISCI
2007
105views more  ISCI 2007»
15 years 1 months ago
Cost modeling of spatial operators using non-parametric regression
In an object-relational database management system, a query optimizer requires users to provide cost models of userdefined functions. The traditional approach is analytical, that...
Songtao Jiang, Byung Suk Lee, Zhen He
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
15 years 7 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...
IPPS
2007
IEEE
15 years 7 months ago
Optimized Inverted List Assignment in Distributed Search Engine Architectures
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
Jiangong Zhang, Torsten Suel
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 7 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
FOCS
1998
IEEE
15 years 5 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello