Sciweavers

1160 search results - page 28 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ICDE
2000
IEEE
116views Database» more  ICDE 2000»
15 years 11 months ago
Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
INFOSCALE
2007
ACM
14 years 11 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
LATIN
2010
Springer
15 years 4 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
JSS
2008
139views more  JSS 2008»
14 years 10 months 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
IKE
2003
14 years 11 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung