Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Access methods for multiversion data
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
Introduction to algorithms
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
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
The advanced video information system: data structures and query processing
Multimedia Systems
VisualSEEk: a fully automated content-based image query system
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
VideoQ: an automated content based video search system using visual cues
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Principles of multimedia database systems
Principles of multimedia database systems
Networked multimedia systems: concepts, architecture and design
Networked multimedia systems: concepts, architecture and design
Spatio-temporal composition and indexing for large multimedia applications
Multimedia Systems
Overlapping linear quadtrees: a spatio-temporal access method
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Assessing multimedia similarity: a framework for structure and motion
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Similarity Based Retrieval of Videos
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth 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
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
External-Memory Algorithms with Applications in GIS
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Spatial and temporal content-based access to hypervideo databases
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Trail-Based Approach for Video Data Indexing and Retrieval
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
A fully automated content-based video search engine supporting spatiotemporal queries
IEEE Transactions on Circuits and Systems for Video Technology
AQUASUN: adaptive window query processing in CAD applications for physical design and verification
Proceedings of the 12th ACM Great Lakes symposium on VLSI
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Journal of Computer Science and Technology
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Trajectory Indexing Using Movement Constraints
Geoinformatica
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
A spatio-temporal access method based on snapshots and events
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Time relaxed spatiotemporal trajectory joins
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Spatio temporal helixes for event modeling
dg.o '02 Proceedings of the 2002 annual national conference on Digital government research
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed spatio-temporal similarity search
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
Round-Eye: A system for tracking nearest surrounders in moving object environments
Journal of Systems and Software
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
TS2-tree - an efficient similarity based organization for trajectory data
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Predictive Indexing for Position Data of Moving Objects in the Real World
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Indexing of Moving Objects on Road Network Using Composite Structure
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Indexing the Trajectories of Moving Objects in Symbolic Indoor Space
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Seismo-surfer: a prototype for collecting, querying, and mining seismic data
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Indexing mobile objects on the plane revisited
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
A pattern-based predictive indexing method for distributed trajectory databases
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
PA-tree: a parametric indexing scheme for spatio-temporal trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Predictive indexing for position data of moving objects in the real world
Transactions on Computational Science VI
Hi-index | 0.00 |
We present a new approach for indexing animated objects and efficiently answering queries about their position in time and space. In particular, we consider an animated movie as a spatiotemporal evolution. A movie is viewed as an ordered sequence of frames, where each frame is a 2D space occupied by the objects that appear in that frame. The queries of interest are range queries of the form, 驴find the objects that appear in area $S$ between frames $f_i$ and $f_j$驴 as well as nearest neighbor queries such as, 驴find the $q$ nearest objects to a given position $A$ between frames $f_i$ and $f_j$.驴 The straightforward approach to index such objects considers the frame sequence as another dimension and uses a 3D access method (such as, an R-Tree or its variants). This, however, assigns long 驴lifetime驴 intervals to objects that appear through many consecutive frames. Long intervals are difficult to cluster efficiently in a 3D index. Instead, we propose to reduce the problem to a partial-persistence problem. Namely, we use a 2D access method that is made partially persistent. We show that this approach leads to faster query performance while still using storage proportional to the total number of changes in the frame evolution. What differentiates this problem from traditional temporal indexing approaches is that objects are allowed to move and/or change their extent continuously between frames. We present novel methods to approximate such object evolutions. We formulate an optimization problem for which we provide an optimal solution for the case where objects move linearly. Finally, we present an extensive experimental study of the proposed methods. While we concentrate on animated movies, our approach is general and can be applied to other spatiotemporal applications as well.