Sciweavers

3341 search results - page 302 / 669
» On Bounded Queries and Approximation
Sort
View
RECOMB
2007
Springer
16 years 7 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
DMSN
2007
ACM
15 years 10 months ago
Declarative temporal data models for sensor-driven query processing
Many sensor network applications monitor continuous phenomena by sampling, and fit time-varying models that capture the phenomena's behaviors. We introduce Pulse, a framework...
Yanif Ahmad, Ugur Çetintemel
SEBD
2007
121views Database» more  SEBD 2007»
15 years 8 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 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
EDBT
2006
ACM
194views Database» more  EDBT 2006»
16 years 6 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...