External memory algorithms and data structures: Dealing with massive data

JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

[图书][B] Data warehouse design: Modern principles and methodologies

M Golfarelli, S Rizzi - 2009 - dl.acm.org
Foreword by Mark Stephen LaRow, Vice President of Products, MicroStrategy" A unique and
authoritative book that blends recent research developments with industry-level practices for …

Trajstore: An adaptive storage system for very large trajectory data sets

P Cudre-Mauroux, E Wu… - 2010 IEEE 26th …, 2010 - ieeexplore.ieee.org
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement
about a range of applications broadly characterized as¿ location based services¿. Current …

Monitoring k-nearest neighbor queries over moving objects

X Yu, KQ Pu, N Koudas - 21st International Conference on …, 2005 - ieeexplore.ieee.org
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN)
queries over moving objects within a geographic area. Existing approaches to this problem …

Spatial join techniques

EH Jacox, H Samet - ACM Transactions on Database Systems (TODS), 2007 - dl.acm.org
A variety of techniques for performing a spatial join are reviewed. Instead of just
summarizing the literature and presenting each technique in its entirety, distinct components …

Algorithms and data structures for external memory

JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

Perceptually based approach for planar shape morphing

L Liu, G Wang, B Zhang, B Guo… - 12th Pacific Conference …, 2004 - ieeexplore.ieee.org
This paper presents an approach for establishing vertex correspondences between two
planar shapes. Correspondences are established between the perceptual feature points …

Hiindex: An efficient spatial index for rapid visualization of large-scale geographic vector data

Z Liu, L Chen, A Yang, M Ma, J Cao - ISPRS International Journal of Geo …, 2021 - mdpi.com
In the big data era, rapid visualization of large-scale vector data has become a serious
challenge in Geographic Information Science (GIS). To fill the gap, we propose HiIndex, a …

Continuous query processing in data streams using duality of data and queries

HS Lim, JG Lee, MJ Lee, KY Whang… - Proceedings of the 2006 …, 2006 - dl.acm.org
Recent data stream systems such as TelegraphCQ have employed the well-known property
of duality between data and queries. In these systems, query processing methods are …

Dynamic maintenance of data distribution for selectivity estimation

KY Whang, SW Kim, G Wiederhold - The VLDB Journal, 1994 - Springer
We propose a new dynamic method for multidimensional selectivity estimation for range
queries that works accurately independent of data distribution. Good estimation of selectivity …