The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Automatic text processing
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
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Improving text retrieval for the routing problem using latent semantic indexing
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient retrieval for browsing large image databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An eigenspace update algorithm for image analysis
Graphical Models and Image Processing
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching
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
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Adaptive estimation of eigensubspace
IEEE Transactions on Signal Processing
Fast time-series searching with scaling and shifting
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Finding generalized projected clusters in high dimensional spaces
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time series similarity measures (tutorial PM-2)
Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Dimensionality reduction and similarity computation by inner product approximations
Proceedings of the ninth international conference on Information and knowledge management
PicASHOW: pictorial authority search by hyperlinks on the Web
Proceedings of the 10th international conference on World Wide Web
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On the effects of dimensionality reduction on high dimensional similarity search
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ensemble-index: a new approach to indexing large databases
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining massively incomplete data sets by conceptual reconstruction
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
PicASHOW: pictorial authority search by hyperlinks on the web
ACM Transactions on Information Systems (TOIS)
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Locally adaptive dimensionality reduction for indexing large time series databases
ACM Transactions on Database Systems (TODS)
Model-Based Video Classification toward Hierarchical Representation, Indexing and Access
Multimedia Tools and Applications
Emergent Semantics through Interaction in Image Databases
IEEE Transactions on Knowledge and Data Engineering
Redefining Clustering for High-Dimensional Applications
IEEE Transactions on Knowledge and Data Engineering
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Trading Quality for Time with Nearest Neighbor Search
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
A Classification Approach for Prediction of Target Events in Temporal Sequences
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
An Incremental Hypercube Approach for Finding Best Matches for Vague Queries
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
COFE: A Scalable Method for Feature Extraction from Complex Objects
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping
IEEE Transactions on Knowledge and Data Engineering
Bitmap indexing method for complex similarity queries with relevance feedback
MMDB '03 Proceedings of the 1st ACM international workshop on Multimedia databases
On the Use of Conceptual Reconstruction for Mining Massively Incomplete Data Sets
IEEE Transactions on Knowledge and Data Engineering
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Dimensionality reduction using magnitude and shape approximations
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Optimizing Similarity Search for Arbitrary Length Time Series Queries
IEEE Transactions on Knowledge and Data Engineering
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Generalized low rank approximations of matrices
ICML '04 Proceedings of the twenty-first international conference on Machine learning
IEEE Transactions on Knowledge and Data Engineering
A distributed database for bio-molecular images
ACM SIGMOD Record
Retrieve images by understanding semantic links and clustering image fragments
Journal of Systems and Software
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Exact k-NN queries on clustered SVD datasets
Information Processing Letters
Finding similarity in time series data by method of time weighted moments
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Generalized Low Rank Approximations of Matrices
Machine Learning
A non-linear dimensionality-reduction technique for fast similarity search in large databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Online summarization of dynamic time series data
The VLDB Journal — The International Journal on Very Large Data Bases
High dimensional nearest neighbor searching
Information Systems
A fast and effective method to find correlations among attributes in databases
Data Mining and Knowledge Discovery
ACM Transactions on Database Systems (TODS)
An in-memory relevance feedback technique for high-performance image retrieval systems
Proceedings of the 6th ACM international conference on Image and video retrieval
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Indexable PLA for efficient similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient Similarity Search over Future Stream Time Series
IEEE Transactions on Knowledge and Data Engineering
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Spatial indexing in microsoft SQL server 2008
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Colibri: fast mining of large static and dynamic graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Embedded Map Projection for Dimensionality Reduction-Based Similarity Search
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Information Sciences: an International Journal
Multimedia Tools and Applications
Multimedia Tools and Applications
Probabilistic Inverse Ranking Queries over Uncertain Data
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A framework for flexible clustering of multiple evolving data streams
International Journal of Advanced Intelligence Paradigms
A time series representation model for accurate and fast similarity detection
Pattern Recognition
Towards faster activity search using embedding-based subsequence matching
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
Nonlinear Embedded Map Projection for Dimensionality Reduction
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Exact k-NN queries on clustered SVD datasets
Information Processing Letters
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
An incremental learning algorithm for optimizing high-dimensional ANN-based classification systems
ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Transforming range queries to equivalent box queries to optimize page access
Proceedings of the VLDB Endowment
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
Real-time approximate Range Motif discovery & data redundancy removal algorithm
Proceedings of the 14th International Conference on Extending Database Technology
Embedding-based subsequence matching in time-series databases
ACM Transactions on Database Systems (TODS)
Scalable kNN search on vertically stored time series
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Searching the video: an efficient indexing method for video retrieval in peer to peer network
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
Kernel principal component analysis for content based image retrieval
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Semantics supervised cluster-based index for video databases
CIVR'06 Proceedings of the 5th international conference on Image and Video Retrieval
An adaptive algorithm for online time series segmentation with error bound guarantee
Proceedings of the 15th International Conference on Extending Database Technology
ACM Computing Surveys (CSUR)
Dimensionality reduction in high-dimensional space for multimedia information retrieval
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Utilizing common substructures to speedup tensor factorization for mining dynamic graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Multi-scale dissemination of time series data
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Searching time series with Hadoop in an electric power company
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Pattern discovery in data streams under the time warping distance
The VLDB Journal — The International Journal on Very Large Data Bases
A data-adaptive and dynamic segmentation index for whole matching on time series
Proceedings of the VLDB Endowment
OBST-based segmentation approach to financial time series
Engineering Applications of Artificial Intelligence
Spatial distance join based feature selection
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimensional index structures such as R*-trees and SS-trees. As dimensionality increases, query performance in these index structures degrades. This phenomenon, generally referred to as the dimensionality curse, can be circumvented by reducing the dimensionality of the data. Such a reduction is however accompanied by a loss of precision of query results. Current techniques such as QBIC use SVD transform-based dimensionality reduction to ensure high query precision. The drawback of this approach is that SVD is expensive to compute, and therefore not readily applicable to dynamic databases. In this paper, we propose novel techniques for performing SVD-based dimensionality reduction in dynamic databases. When the data distribution changes considerably so as to degrade query precision, we recompute the SVD transform and incorporate it in the existing index structure. For recomputing the SVD-transform, we propose a novel technique that uses aggregate data from the existing index rather than the entire data. This technique reduces the SVD-computation time without compromising query precision. We then explore efficient ways to incorporate the recomputed SVD-transform in the existing index structure without degrading subsequent query response times. These techniques reduce the computation time by a factor of 20 in experiments on color and texture image vectors. The error due to approximate computation of SVD is less than 10%.