Sciweavers

1890 search results - page 192 / 378
» Querying Big Data by Accessing Small Data
Sort
View
89
Voted
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 3 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
194
Voted
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 1 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 5 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
102
Voted
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
15 years 11 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...
CIKM
2005
Springer
15 years 5 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu