Sciweavers

1381 search results - page 165 / 277
» Structural signatures for tree data structures
Sort
View
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
15 years 11 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
15 years 5 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
DEXA
2010
Springer
187views Database» more  DEXA 2010»
14 years 8 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
SIGCSE
2009
ACM
137views Education» more  SIGCSE 2009»
15 years 10 months ago
The hidden injuries of overloading 'ADT'
commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, lik...
Duane Buck, David J. Stucki
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 4 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...