Sciweavers

1611 search results - page 54 / 323
» Queries Independent of Updates
Sort
View
TPHOL
2008
IEEE
15 years 4 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
15 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
SIGMOD
2003
ACM
171views Database» more  SIGMOD 2003»
15 years 10 months ago
Adaptive Filters for Continuous Queries over Distributed Data Streams
We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Signif...
Chris Olston, Jing Jiang, Jennifer Widom
EDBT
2008
ACM
99views Database» more  EDBT 2008»
15 years 10 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
ESWS
2010
Springer
15 years 2 months ago
Improving the Performance of Semantic Web Applications with SPARQL Query Caching
The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which ...
Michael Martin, Jörg Unbehauen, Sören Au...