Sciweavers

1388 search results - page 114 / 278
» Querying Linguistic Trees
Sort
View
218
Voted
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 10 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
238
Voted
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 12 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ADC
2008
Springer
143views Database» more  ADC 2008»
15 years 9 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
ISCC
2008
IEEE
105views Communications» more  ISCC 2008»
16 years 1 months ago
VoRaQue: Range queries on Voronoi overlays
—This paper presents VoRaQue, a software layer supporting range queries on Voronoi P2P overlays. VoRaQue maps data in a 2-dimensional space. The P2P overlay is defined by links ...
Michele Albano, Laura Ricci, Martina Baldanzi, Ran...
218
Voted
SIAMCOMP
2012
13 years 9 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...