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
CIKM '93 Proceedings of the second international conference on Information and knowledge management
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
A data model and data structures for moving objects databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
Using space-time grid for efficient management of moving objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Querying the trajectories of on-line mobile objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
A Framework for Generating Network-Based Moving Objects
Geoinformatica
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
The Geometry of Uncertainty in Moving Objects Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Cost and Imprecision in Modeling the Position of Moving Objects
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Multiple Range Query Optimization in Spatial Databases
ADBIS '98 Proceedings of the Second East European Symposium on Advances in Databases and Information Systems
Indexing Mobile Objects on the Plane
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Query Processing for Moving Objects with Space-Time Grid Storage Model
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
SEB-tree: An Approach to Index Continuously Moving Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Indexing the Trajectories of Moving Objects in Networks (Extended Abstract)
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
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
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Integrated data management for mobile services in the real world
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Supporting uncertainty in moving objects in network databases
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Proceedings of the 2006 ACM symposium on Applied computing
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Virtual observers in a mobile surveillance system
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Information Sciences: an International Journal
Indexing future trajectories of moving objects in a constrained network
Journal of Computer Science and Technology
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
Trigger Based Security Alarming Scheme for Moving Objects on Road Networks
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
Index Method for Tracking Network-Constrained Moving Objects
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Efficient search of moving objects on a planar graph
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Advanced Web and NetworkTechnologies, and Applications
Indexing of Continuously Moving Objects on Road Networks
IEICE - Transactions on Information and Systems
Improved partition method for tracking moving objects in road networks
International Journal of Advanced Intelligence Paradigms
Efficient MaxCount and threshold operators of moving objects
Geoinformatica
Update-efficient indexing of moving objects in road networks
Geoinformatica
BerlinMOD: a benchmark for moving object databases
The VLDB Journal — The International Journal on Very Large Data Bases
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Path prediction of moving objects on road networks through analyzing past trajectories
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
On the effect of trajectory compression in spatiotemporal querying
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Distributed, concurrent range monitoring of spatial-network constrained mobile objects
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Recursive partitioning method for trajectory indexing
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
StarTrack next generation: a scalable infrastructure for track-based applications
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Uncertain distance-based range queries over uncertain moving objects
Journal of Computer Science and Technology
Indexing frequently updated trajectories of network-constrained moving objects
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Collecting and managing network-matched trajectories of moving objects in databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Indexing in-network trajectory flows
The VLDB Journal — The International Journal on Very Large Data Bases
A new trajectory indexing scheme for moving objects on road networks
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Moving objects in networks databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Ordered polyline trees for efficient search of objects moving on a graph
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
Incremental evaluation of continuous range queries over objects moving on known network paths
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
Searching similar trajectories in real time: an effectiveness and efficiency study
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Boosting moving object indexing through velocity partitioning
Proceedings of the VLDB Endowment
Continuous queries on trajectories of moving objects
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Finding time period-based most frequent path in big trajectory data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Trajectory based traffic analysis
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Quick geo-fencing using trajectory partitioning and boundary simplification
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time, called moving objects. The main interest of these applications is to efficiently store and query the positions of these continuously moving objects. To achieve this goal, index structures are required. The main proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. Constrained movement is a special and a very important case of object movement. For example, cars move in roads and trains in railroads. In this paper we propose a new index structure for moving objects on networks, the MON-Tree. We describe two network models that can be indexed by the MON-Tree. The first model is edge oriented, i.e., the network consists of nodes and edges and there is a polyline associated to each edge. The second one is more suitable for transportation networks and is route oriented, i.e., the network consists of routes and junctions. In this model, a polyline also serves as a representation of the routes. We propose the index in terms of the basic algorithms for insertion and querying. We test our proposal in an extensive experimental evaluation with generated data sets using as underlying networks the roads of Germany. In our tests, the MON-Tree shows good scalabiliy and outperforms the competing index structures in updating (index creation) as well as in querying.