Sciweavers

9683 search results - page 1676 / 1937
» Query performance prediction
Sort
View
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 4 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
16 years 4 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
SIGMOD
2001
ACM
135views Database» more  SIGMOD 2001»
16 years 4 months ago
The Network is the Database: Data Management for Highly Distributed Systems
This paper describes the methodology and implementation of a data management system for highly distributed systems, which was built to solve the scalability and reliability proble...
Julio C. Navas, Michael J. Wynblatt
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 4 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 4 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
« Prev « First page 1676 / 1937 Last » Next »