Sciweavers

1888 search results - page 75 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
16 years 5 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
DEXA
2004
Springer
140views Database» more  DEXA 2004»
15 years 10 months ago
Declustering of Trajectories for Indexing of Moving Objects Databases
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
Youngduk Seo, Bonghee Hong
CGF
2010
147views more  CGF 2010»
15 years 4 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
DOLAP
2000
ACM
15 years 8 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
TKDE
2002
168views more  TKDE 2002»
15 years 4 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han