Sciweavers

983 search results - page 88 / 197
» Continuous Queries in Oracle
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 10 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
15 years 11 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
15 years 11 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu
WWW
2006
ACM
15 years 10 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 3 months ago
Seaweed: Distributed Scalable Ad Hoc Querying
Many emerging applications such as wide-area network management need to query large, structured, highly distributed datasets. Seaweed is a distributed scalable infrastructure for ...
Richard Mortier, Dushyanth Narayanan, Austin Donne...