5746 search results - page 157 / 1150 » Visualizing Query Structure |
153
click to vote
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
141
click to vote
WEBDB
2004
Springer
15 years 11 months ago
2004
Springer
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
150
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
143
Voted
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
157
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...