Sciweavers

316 search results - page 21 / 64
» Top-K aggregation queries over large networks
Sort
View
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
15 years 4 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
ISCC
2009
IEEE
198views Communications» more  ISCC 2009»
15 years 4 months ago
An analysis of the heterogeneity and IP packet reordering over multiple wireless networks
Abstract—With the increasing deployment of wireless technologies, such as WLAN, HSDPA, and WiMAX, it is often the case that simultaneous coverage of several access networks is av...
Dominik Kaspar, Kristian Evensen, Audun Fosselie H...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
15 years 10 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 10 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
14 years 11 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount