Sciweavers

423 search results - page 17 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
137
Voted
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
15 years 7 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
119
Voted
EDBT
2006
ACM
194views Database» more  EDBT 2006»
16 years 2 months ago
On Concurrency Control in Sliding Window Queries over Data Streams
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
Lukasz Golab, Kumar Gaurav Bijay, M. Tamer Öz...
CCGRID
2006
IEEE
15 years 8 months ago
Calder Query Grid Service: Insights and Experimental Evaluation
We have architected and evaluated a new kind of data resource, one that is composed of a logical collection of ephemeral data streams that could be viewed as a collection of publi...
Nithya N. Vijayakumar, Ying Liu, Beth Plale
CIKM
2004
Springer
15 years 7 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner
115
Voted
SIGIR
2008
ACM
15 years 1 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...