685 search results - page 65 / 137 » Closure Operators for Order Structures |
211
Voted
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use t...
187
Voted
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
102
Voted
SAC
2002
ACM
15 years 2 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
108
Voted
PVLDB
2010
15 years 29 days ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
131
click to vote
SAC
2006
ACM
15 years 8 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...