Sciweavers

1388 search results - page 83 / 278
» Querying Linguistic Trees
Sort
View
99
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 4 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
98
Voted
DEXA
2005
Springer
111views Database» more  DEXA 2005»
15 years 2 months ago
On the General Signature Trees
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different ...
Yangjun Chen
FGCS
2000
81views more  FGCS 2000»
15 years 12 days ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
MICS
2010
137views more  MICS 2010»
14 years 11 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
16 years 22 days ago
Querying xml with update syntax
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
Wenfei Fan, Gao Cong, Philip Bohannon