Sciweavers

582 search results - page 12 / 117
» Performance Comparison of Point and Spatial Access Methods
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 9 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ASAP
2005
IEEE
151views Hardware» more  ASAP 2005»
14 years 1 months ago
Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform
This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies’ real-to-real method of four coefficients (Daub-...
Asadollah Shahbahrami, Ben H. H. Juurlink, Stamati...
SSD
2009
Springer
193views Database» more  SSD 2009»
14 years 2 months ago
Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases
Outsourcing data to third party data providers is becoming a common practice for data owners to avoid the cost of managing and maintaining databases. Meanwhile, due to the populari...
Wei-Shinn Ku, Ling Hu, Cyrus Shahabi, Haixun Wang
AH
2004
Springer
14 years 1 months ago
Machine Learning Methods for One-Session Ahead Prediction of Accesses to Page Categories
This paper presents a comparison among several well-known machine learning techniques when they are used to carry out a one-session ahead prediction of page categories. We use reco...
José David Martín-Guerrero, Emili Ba...
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
13 years 11 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein