Sciweavers

1388 search results - page 102 / 278
» Querying Linguistic Trees
Sort
View
LATIN
2010
Springer
15 years 7 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
100
Voted
COSIT
1995
Springer
111views GIS» more  COSIT 1995»
15 years 4 months ago
Range Queries Involving Spatial Relations: A Performance Analysis
: Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we sh...
Yannis Theodoridis, Dimitris Papadias
105
Voted
JSS
2008
139views more  JSS 2008»
15 years 19 days ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
99
Voted
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 6 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
IPTPS
2005
Springer
15 years 6 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang