Sciweavers

511 search results - page 39 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
EDBT
2000
ACM
15 years 9 months ago
Materialized View Selection for Multi-Cube Data Models
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
XSYM
2004
Springer
129views Database» more  XSYM 2004»
15 years 11 months ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 5 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
ADC
2010
Springer
266views Database» more  ADC 2010»
15 years 1 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
ADC
2003
Springer
94views Database» more  ADC 2003»
15 years 11 months ago
Multi-resolution Algorithms for Building Spatial Histograms
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
Qing Liu, Yidong Yuan, Xuemin Lin