Faster methods for random sampling
Communications of the ACM
Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: an introduction
Computational geometry: an introduction
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Window query-optimal clustering of spatial objects
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Are window queries representative for arbitrary range queries?
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Spatio-temporal composition and indexing for large multimedia applications
Multimedia Systems
Direction relations and two-dimensional range queries: optimisation techniques
Data & Knowledge Engineering
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Maintaining knowledge about temporal intervals
Communications of the ACM
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
Object Relational DBMSs: The Next Great Wave
Object Relational DBMSs: The Next Great Wave
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
The Effect of Buffering on the Performance of R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Cost Models for Join Queries in Spatial Databases
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Recovering Information from Summary Data
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Object-Based Directional Query Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Evaluation of Access Structures for Discretely Moving Points
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
The power-method: a comprehensive estimation technique for multi-dimensional queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Analysis of predictive spatio-temporal queries
ACM Transactions on Database Systems (TODS)
Approximation techniques for spatial data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A cost model for spatio-temporal queries using the TPR-tree
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Motion adaptive indexing for moving continual queries over moving objects
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Processing Moving Queries over Moving Objects Using Motion-Adaptive Indexes
IEEE Transactions on Knowledge and Data Engineering
Cost models for distance joins queries using R-trees
Data & Knowledge Engineering
Optimizing distributed spatial joins using R-Trees
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Indexing future trajectories of moving objects in a constrained network
Journal of Computer Science and Technology
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Update-efficient indexing of moving objects in road networks
Geoinformatica
Location sensitive indexing for image-based advertising
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Optimal matching between spatial datasets under capacity constraints
ACM Transactions on Database Systems (TODS)
Indexing in-network trajectory flows
The VLDB Journal — The International Journal on Very Large Data Bases
Hierarchical metadata driven view selection for spatial query evaluations
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Selective view materialization in a spatial data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Medoid queries in large spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Authenticating location-based services without compromising location privacy
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficiently processing snapshot and continuous reverse k nearest neighbors queries
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient distributed multi-dimensional index for big data management
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
Selection and join queries are fundamental operations in Data Base Management Systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. In this paper, we present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-tree-based structures. The proposed formulae need no knowledge of the underlying R-tree structure(s) and are applicable to uniform-like and nonuniform data distributions. In addition, experimental results are presented which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets.