Sciweavers

958 search results - page 86 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
WAIM
2007
Springer
15 years 4 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
85
Voted
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
14 years 10 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
TKDE
2002
127views more  TKDE 2002»
14 years 9 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
ICML
2008
IEEE
15 years 11 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 1 months ago
Collaborative caching for spatial queries in Mobile P2P Networks
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
Qijun Zhu, Dik Lun Lee, Wang-Chien Lee