1007 search results - page 47 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
147
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
157
click to vote
EDBT
1992
ACM
15 years 5 months ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
133
click to vote
ICDE
2011
IEEE
14 years 6 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
150
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Demands on better interacting with physical world require an effective and comprehensive collaboration mechanism among multiple heterogeneous sensor networks. Previous works mainl...
124
Voted
CF
2009
ACM
15 years 7 months ago
2009
ACM
Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that processes large data sets. Traditionally, DSS queries have been acce...