Sciweavers

716 search results - page 51 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 4 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2009
IEEE
126views Database» more  SSDBM 2009»
15 years 6 months ago
Comprehensive Optimization of Declarative Sensor Network Queries
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
Ixent Galpin, Christian Y. A. Brenninkmeijer, Farh...
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 2 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 18 days ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
16 years 18 days ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...