Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 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
Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
On the propagation of errors in the size of join results
SIGMOD '91 Proceedings of the 1991 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
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
An effective way to represent quadtrees
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
QBISM: Extending a DBMS to Support 3D Medical Images
Proceedings of the Tenth 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
Optimization for Spatial Query Processing
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
On B-Tree Indices for Skewed Distributions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Proceedings of the Sixth International Conference on Data Engineering
A random model for analyzing region quadtrees
Pattern Recognition Letters
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Perspectives on database theory
ACM SIGACT News
Towards practical constraint databases (extended abstract)
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
Parallel processing of nearest neighbor queries in declustered spatial data
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A spatial data mining method by Delaunay triangulation
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Similarity query processing using disk arrays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimization techniques for queries with expensive methods
ACM Transactions on Database Systems (TODS)
Self-spacial join selectivity estimation using fractal concepts
ACM Transactions on Information Systems (TOIS)
Multidimensional access methods
ACM Computing Surveys (CSUR)
Selectivity estimation of Window queries for line segment datasets
Proceedings of the seventh international conference on Information and knowledge management
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed Systems
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Spatial join selectivity using power laws
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Distributed Processing of Similarity Queries
Distributed and Parallel Databases
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Modeling high-dimensional index structures using sampling
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
General match: a subsequence matching method in time-series databases based on generalized windows
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Window Query Processing in Linear Quadtrees
Distributed and Parallel Databases
Algorithms for Hierarchical Spatial Reasoning
Geoinformatica
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
A New Indexing Scheme for Content-Based Image Retrieval
Multimedia Tools and Applications
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Accurate Modeling of Region Data
IEEE Transactions on Knowledge and Data Engineering
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
Toward an Accurate Analysis of Range Queries on Spatial Data
IEEE Transactions on Knowledge and Data Engineering
Dynamically Optimizing High-Dimensional Index Structures
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
On the Generation of 2-Dimensional Index Workloads
ICDT '99 Proceedings of the 7th International Conference on Database Theory
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
MindReader: Querying Databases Through Multiple Examples
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension
VLDB '96 Proceedings of the 22th 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
An Empirical Study of a New Approach to Nearest Neighbor Searching
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Wavelet-Based Cost Estimation for Spatial Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Well-Behaved, Tunable 3D-Affine Invariants
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
The power-method: a comprehensive estimation technique for multi-dimensional queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
Direct Mesh: a Multiresolution Approach to Terrain Visualization
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Trajectory Indexing Using Movement Constraints
Geoinformatica
Fast estimation of fractal dimension and correlation integral on stream data
Information Processing Letters
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Generalized multidimensional data mapping and query processing
ACM Transactions on Database Systems (TODS)
Cost models for distance joins queries using R-trees
Data & Knowledge Engineering
Evaluating the intrinsic dimension of evolving data streams
Proceedings of the 2006 ACM symposium on Applied computing
The social network of Java classes
Proceedings of the 2006 ACM symposium on Applied computing
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A metric index for approximate string matching
Theoretical Computer Science
A Multiresolution Terrain Model for Efficient Visualization Query Processing
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on Database Systems (TODS)
Processing partially specified queries over high-dimensional databases
Data & Knowledge Engineering
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Multimedia Tools and Applications
Data access in distributed simulations of multi-agent systems
Journal of Systems and Software
REDUS: finding reducible subspaces in high dimensional data
Proceedings of the 17th ACM conference on Information and knowledge management
ACM Transactions on Knowledge Discovery from Data (TKDD)
Measuring evolving data streams' behavior through their intrinsic dimension
New Generation Computing
A revised r*-tree in comparison with related index structures
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Feature Subset Selection for Supervised Learning using Fractal Dimension
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Fast estimation of fractal dimension and correlation integral on stream data
Information Processing Letters
Index structures for data warehouses
Index structures for data warehouses
Can shared-neighbor distances defeat the curse of dimensionality?
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Proceedings of the 14th International Conference on Extending Database Technology
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
A cost model for an adaptive cell-based index structure
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A fractal dimension based filter algorithm to select features for supervised learning
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
To be or not to be real: fractal analysis of data streams from a regional climate change model
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Proceedings of the 22nd international conference on World Wide Web companion
| Hi-index | 0.00 |
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S. counties, star coordinates from NASA's Infrared-Ultraviolet Explorer etc.) we provide evidence that real data indeed are skewed, and, moreover, we show that they behave as mathematical fractals, with a measurable, non-integer fractal dimension.Armed with this tool, we then show its practical use in predicting the performance of spatial access methods, and specifically of the R-trees. We provide the first analysis of R-trees for skewed distributions of points: We develop a formula that estimates the number of disk accesses for range queries, given only the fractal dimension of the point set, and its count. Experiments on real data sets show that the formula is very accurate: the relative error is usually below 5%, and it rarely exceeds 10%.We believe that the fractal dimension will help replace the uniformity and independence assumptions, allowing more accurate analysis for any spatial access method, as well as better estimates for query optimization on multi-attribute queries.