Sciweavers

964 search results - page 37 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
VLDB
2005
ACM
120views Database» more  VLDB 2005»
15 years 10 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
VLDB
1997
ACM
86views Database» more  VLDB 1997»
15 years 8 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy
DASFAA
2007
IEEE
134views Database» more  DASFAA 2007»
15 years 10 months ago
Eliciting Matters - Controlling Skyline Sizes by Incremental Integration of User Preferences
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation ...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
SERVICES
2008
103views more  SERVICES 2008»
15 years 5 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
DPD
2006
141views more  DPD 2006»
15 years 4 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...