1388 search results - page 114 / 278 » Querying Linguistic Trees |
125
click to vote
DASFAA
2004
IEEE
15 years 4 months ago
2004
IEEE
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...
153
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
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...
113
Voted
ADC
2008
Springer
15 years 2 months ago
2008
Springer
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...
118
Voted
ISCC
2008
IEEE
15 years 7 months ago
2008
IEEE
—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 ...
130
Voted
SIAMCOMP
2012
13 years 3 months ago
2012
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...