Sciweavers

785 search results - page 41 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
VLDB
1994
ACM
99views Database» more  VLDB 1994»
14 years 27 days ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 9 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
ICPR
2010
IEEE
14 years 4 days ago
Improving the Efficiency of Content-Based Multimedia Exploration
Visual exploration systems enable users to search, browse, and explore voluminous multimedia databases in an interactive and playful manner. Whether users know the database's ...
Christian Beecks, Sascha Wiedenfeld, Thomas Seidl