Access the full text.
Sign up today, get DeepDyve free for 14 days.
Aboulnaga A.
123
Stefan Berchtold, C. Böhm, D. Keim, Florian Krebs, H. Kriegel (2001)
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
N. Thaper, S. Guha, P. Indyk, Nick Koudas (2002)
Dynamic multidimensional histograms
Yi-Leh Wu, D. Agrawal, A. Abbadi (2001)
Applying the golden rule of sampling for query estimation, 30
Yufei Tao, Jimeng Sun, D. Papadias (2003)
Selectivity estimation for predictive spatio-temporal queriesProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
M. Berg (1997)
Computational geometry: algorithms and applications
Simonas Šaltenis, Christian Jensen (2002)
Indexing of moving objects for location-based servicesProceedings 18th International Conference on Data Engineering
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries
E. Gardner (1985)
Exponential smoothing: The state of the artJournal of Forecasting, 4
W. Press, S. Teukolsky, W. Vetterling, B. Flannery (2002)
Numerical recipes in C
Nicolas Bruno, S. Chaudhuri, L. Gravano (2001)
STHoles: a multidimensional workload-aware histogram
S. Acharya, V. Poosala, S. Ramaswamy (1999)
Selectivity estimation in spatial databases
Yufei Tao, D. Papadias (2002)
Time-parameterized queries in spatio-temporal databases
P. Agarwal, L. Arge, Jeff Erickson (2000)
Indexing moving points (extended abstract)
Yun-Wu Huang, N. Jing, Elke Rundensteiner (1997)
A cost model for estimating the performance of spatial joins using R-treesProceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150)
K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft (1999)
When Is ''Nearest Neighbor'' Meaningful?
Y. Theodoridis, Jefferson Silva, M. Nascimento (1999)
On the Generation of Spatiotemporal Datasets
N. Mamoulis, D. Papadias (2001)
Multiway spatial joinsACM Transactions on Database Systems (TODS), 26
Ju-hong Lee, Deok‐Hwan Kim, C. Chung (1999)
Multi-dimensional selectivity estimation using compressed histogram information
A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos (2000)
Closest pair queries in spatial databases
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching
Yossi Matias, J. Vitter, Min Wang (2000)
Dynamic Maintenance of Wavelet-Based Histograms
A. Belussi, C. Faloutsos (1998)
Self-spacial join selectivity estimation using fractal conceptsACM Trans. Inf. Syst., 16
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles
S. Chaudhuri, Gautam Das, Mayur Datar, R. Motwani, Vivek Narasayya (2001)
Overcoming limitations of sampling for aggregation queriesProceedings 17th International Conference on Data Engineering
Björn Blohsfeld, Dieter Korus, B. Seeger (1999)
A comparison of selectivity estimators for range queries on metric attributes
Dan Suciu, G. Weikum (2005)
ACM Transactions on Database SystemsACM Transactions on Database Systems, 30
C. Faloutsos, B. Seeger, A. Traina, C. Traina (2000)
Spatial join selectivity using power laws
Stefan Berchtold, C. Böhm, D. Keim, H. Kriegel (1997)
A cost model for nearest neighbor search in high-dimensional data space
(2003)
Analysis of Predictive Spatio-Temporal Queries @BULLET 335
M. Muralikrishna, D. DeWitt (1988)
Equi-depth multidimensional histograms, 17
Guido Proietti, C. Faloutsos (2001)
Accurate Modeling of Region DataIEEE Trans. Knowl. Data Eng., 13
R. Weber, H. Schek, Stephen Blott (1998)
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
D. Gunopulos, G. Kollios, V. Tsotras, C. Domeniconi (2000)
Approximating multi-dimensional aggregate range queries over real attributes
Yufei Tao, D. Papadias (2003)
Spatial queries in dynamic environmentsACM Trans. Database Syst., 28
Y. Theodoridis, E. Stefanakis, T. Sellis (2000)
Efficient Cost Models for Spatial Queries Using R-TreesIEEE Trans. Knowl. Data Eng., 12
Christian Bohm (2000)
A cost model for query processing in high dimensional data spacesACM Transactions on Database Systems, 25
R. Benetis, Christian Jensen, Gytis Karciauskas, Simonas Šaltenis (2002)
Nearest neighbor and reverse nearest neighbor queries for moving objectsProceedings International Database Engineering and Applications Symposium
A. Belussi, C. Faloutsos (1995)
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
Yossi Matias, J. Vitter, Min Wang (1998)
Wavelet-based histograms for selectivity estimation
Thomas Brinkhoff (2002)
A Framework for Generating Network-Based Moving ObjectsGeoInformatica, 6
Marios Hadjieleftheriou, G. Kollios, V. Tsotras (2003)
Performance evaluation of spatio-temporal selectivity estimation techniques15th International Conference on Scientific and Statistical Database Management, 2003.
C. Palmer, C. Faloutsos (2000)
Density biased sampling: an improved method for data mining and clustering
M. Muralikrishna, D. DeWitt (1988)
Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries
Chengyu Sun, D. Agrawal, A. Abbadi (2002)
Selectivity Estimation for Spatial Joins with Geometric Selections
Y. Theodoridis, E. Stefanakis, T. Sellis (1998)
Cost models for join queries in spatial databasesProceedings 14th International Conference on Data Engineering
I. Kamel, C. Faloutsos (1993)
On packing R-trees
Guido Proietti, C. Faloutsos (1998)
Selectivity estimation of Window queries for line segment datasets
N. An, Zhen-Yu Yang, A. Sivasubramaniam (2001)
Selectivity estimation for spatial joinsProceedings 17th International Conference on Data Engineering
D. Pfoser, Christian Jensen, Y. Theodoridis (2000)
Novel Approaches to the Indexing of Moving Object Trajectories
Chengyu Sun, Nagender Bandi, D. Agrawal, A. Abbadi (2002)
Exploring spatial datasets with histogramsDistributed and Parallel Databases, 20
Simonas Šaltenis, Christian Jensen, Scott Leutenegger, M. Lopez (2000)
Indexing the positions of continuously moving objects
D. Pfoser, Christian Jensen, Y. Theodoridis (2000)
Novel Approaches in Query Processing for Moving Object Trajectories
W. Aref, H. Samet (1994)
A Cost Model for Query Optimization Using R-Trees
Gísli Hjaltason, H. Samet (1999)
Distance browsing in spatial databasesACM Trans. Database Syst., 24
Marios Hadjieleftheriou, G. Kollios, V. Tsotras, D. Gunopulos (2002)
Efficient Indexing of Spatiotemporal Objects
Ji Jin, N. An, A. Sivasubramaniam (2000)
Analyzing range queries on spatial dataProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
P. Agarwal, L. Arge, Jeff Erickson (2003)
Indexing Moving PointsJ. Comput. Syst. Sci., 66
Yong-Jin Choi, C. Chung (2002)
Selectivity estimation for spatio-temporal queries to moving objects
F. Olken, D. Rotem (1990)
Random Sampling from Database Files: A Survey
C. Böhm (2000)
A cost model for query processing in high dimensional data spacesACM Trans. Database Syst., 25
Yufei Tao, D. Papadias, Jimeng Sun (2003)
The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries
Ashraf Aboulnaga, J. Naughton (2000)
Accurate estimation of the cost of spatial selectionsProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
P. Ciaccia, M. Patella, P. Zezula (1998)
A cost model for similarity queries in metric spaces
(2002)
Received October
A. Papadopoulos, Y. Manolopoulos (1997)
Performance of Nearest Neighbor Queries in R-Trees
G. Kollios, D. Gunopulos, V. Tsotras (1999)
On indexing mobile objects
V. Poosala, Y. Ioannidis (1997)
Selectivity Estimation Without the Attribute Value Independence Assumption
Bernd-Uwe Pagel, H. Six, H. Toben, P. Widmayer (1993)
Towards an analysis of range query performance in spatial data structures
A. Deshpande, M. Garofalakis, R. Rastogi (2001)
Independence is good: dependency-based histogram synopses for high-dimensional data
Given a set of objects S , a spatio-temporal window query q retrieves the objects of S that will intersect the window during the (future) interval q T . A nearest neighbor query q retrieves the objects of S closest to q during q T . Given a threshold d , a spatio-temporal join retrieves the pairs of objects from two datasets that will come within distance d from each other during q T . In this article, we present probabilistic cost models that estimate the selectivity of spatio-temporal window queries and joins, and the expected distance between a query and its nearest neighbor(s). Our models capture any query/object mobility combination (moving queries, moving objects or both) and any data type (points and rectangles) in arbitrary dimensionality. In addition, we develop specialized spatio-temporal histograms, which take into account both location and velocity information, and can be incrementally maintained. Extensive performance evaluation verifies that the proposed techniques produce highly accurate estimation on both uniform and non-uniform data.
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Dec 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.