Sciweavers

485 search results - page 52 / 97
» Processing complex aggregate queries over data streams
Sort
View
166
Voted
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 6 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
144
Voted
SAC
2010
ACM
15 years 7 months ago
On processing location based top-k queries in the wireless broadcasting system
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
HaRim Jung, Byung Ku Cho, Yon Dohn Chung, Ling Liu
104
Voted
PODS
2004
ACM
189views Database» more  PODS 2004»
16 years 20 days ago
The Lixto Data Extraction Project - Back and Forth between Theory and Practice
We present the Lixto project, which is both a research project in database theory and a commercial enterprise that develops Web data extraction (wrapping) and Web service definiti...
Georg Gottlob, Christoph Koch, Robert Baumgartner,...
113
Voted
SIGMOD
2003
ACM
209views Database» more  SIGMOD 2003»
16 years 20 days ago
Distributed Top-K Monitoring
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumenta...
Brian Babcock, Chris Olston
204
Voted
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
16 years 1 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...