Sciweavers

250 search results - page 22 / 50
» Tree pattern query minimization
Sort
View
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
15 years 11 months ago
Processing Event-Monitoring Queries in Sensor Networks
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Vassilis Stoumpos, Antonios Deligiannakis, Yannis ...
76
Voted
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
15 years 4 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
AMAI
1999
Springer
14 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
84
Voted
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 3 days ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
LPAR
2012
Springer
13 years 5 months ago
Querying Proofs
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
David Aspinall, Ewen Denney, Christoph Lüth