Sciweavers

173 search results - page 32 / 35
» Range queries in dynamic OLAP data cubes
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 8 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
PVLDB
2008
118views more  PVLDB 2008»
13 years 7 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
SSD
2009
Springer
167views Database» more  SSD 2009»
14 years 2 months ago
Continuous Spatial Authentication
Recent advances in wireless communications and positioning devices have generated a tremendous amount of interest in the continuous monitoring of spatial queries. However, such app...
Stavros Papadopoulos, Yin Yang, Spiridon Bakiras, ...
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
13 years 11 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
14 years 1 months ago
Update Conscious Bitmap Indices
Bitmap indices have been widely used in several domains such as data warehousing and scientific applications due to their efficiency in answering certain query types over large ...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...