Sciweavers

383 search results - page 6 / 77
» Just-In-Time Processing of Continuous Queries
Sort
View
ICDE
2011
IEEE
380views Database» more  ICDE 2011»
12 years 11 months ago
Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the c...
Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Y...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 9 months ago
Simultaneous Equation Systems for Query Processing on Continuous-Time Data Streams
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...
INFOCOM
2006
IEEE
14 years 1 months ago
SmartSeer: Using a DHT to Process Continuous Queries Over Peer-to-Peer Networks
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 9 months ago
ICEDB: Intermittently-Connected Continuous Query Processing
Current distributed database and stream processing systems assume that the network connecting nodes in the data processor is "always on," and that the absence of a netwo...
Yang Zhang, Bret Hull, Hari Balakrishnan, Samuel M...
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 9 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...