Sciweavers

983 search results - page 6 / 197
» Continuous Queries in Oracle
Sort
View
SIGMOD
2002
ACM
145views Database» more  SIGMOD 2002»
15 years 9 months ago
Continuously adaptive continuous queries over streams
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
Samuel Madden, Mehul A. Shah, Joseph M. Hellerstei...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 5 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 3 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
158
Voted
SIGMOD
2005
ACM
145views Database» more  SIGMOD 2005»
15 years 9 months ago
Native Xquery processing in oracle XMLDB
With XQuery becoming the standard language for querying XML, and the relational SQL platform being recognized as an important platform to store and process XML, the SQL/XML standa...
Zhen Hua Liu, Muralidhar Krishnaprasad, Vikas Aror...
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu