15 Hits in 2.3 sec

Top-k queries on temporal data

Feifei Li, Ke Yi, Wangchao Le
2010 The VLDB journal  
Extensive experiments on a number of large data sets, show that the Seb-tree is more than an order of magnitude faster than the R-tree based indexes for temporal ranking queries.  ...  We present the Seb-tree, a simple indexing scheme that supports temporal ranking queries much more efficiently.  ...  There are also extensive studies on indexing and querying continuous moving objects, e.g., [23, 31, 33, 35, 38, 40] .  ... 
doi:10.1007/s00778-010-0186-6 fatcat:z6yjdhz5anbvtjgofpfxhtrxim

Spatiotemporal Access Methods [chapter]

Yannis Manolopoulos, Yannis Theodoridis, Vassilis J. Tsotras
2000 Advanced Database Indexing  
In addition, the server stores additional information to help predict the future positions of moving objects.  ...  Numerous research have been done in developing spatio-temporal access methods as an auxiliary structure to support spatio-temporal queries.  ...  Each zone is indexed using the SEB-tree that considers only the start and end timestamps of the moving objects. Each moving object is hashed to its zone.  ... 
doi:10.1007/978-1-4419-8590-3_7 fatcat:2ubplcflmngf5eiwqdthnlzbzm

Review of Spatiotemporal Data Indexing Structures

K. Venkateswara Rao, Department of CSE, CVR College of Engineering, Ibrahimpatnam, Hyderabad, India, A. Govardhan, K.V. Chalapati Rao, School of Information Technology, JNTUH Hyderabad, India, Department of CSE, CVR College of Engineering, Ibrahimpatnam, Hyderabad, India
2015 CVR Journal of Science & Technology  
Spatiotemporal data are those objects that change their position and/or extent over time.  ...  Efficient processing of the spatiotemporal data needs sophisticated indexing schemes. Many indexing structures are available in the literature for accessing such data sets.  ...  TB-tree, SETI, SEB-tree, CSE-tree, Polar-tree and RTR-tree fall into this category. Trajectory-bundle tree (TB-tree) [1, 16] structure is similar to R-tree and is an extension of STR-tree [7] .  ... 
doi:10.32377/cvrjst0801 fatcat:4ndnq465lbaajfyld4bwbnvd54

A Flexible Spatio-Temporal Indexing Scheme for Large-Scale GPS Track Retrieval

Longhao Wang, Yu Zheng, Xing Xie, Wei-Ying Ma
2008 The Ninth International Conference on Mobile Data Management (mdm 2008)  
In this paper, we first propose a probabilistic model to simulate user behavior of uploading GPS tracks onto an online sharing application.  ...  In these applications, spatial or temporal search function could provide an effective way for users to retrieve specific GPS tracks they are interested in.  ...  index and compare CSE-tree to the R-tree [17] and SEB-tree [18] .  ... 
doi:10.1109/mdm.2008.24 dblp:conf/mdm/WangZXM08 fatcat:p6iovbaogba4zhg6bpfech47me

An Efficient Index for Contact Tracing Query in a Large Spatio-Temporal Database [article]

Mohammed Eunus Ali, Shadman Saqib Eusuf, Kazi Ashik Islam
2020 arXiv   pre-print
A straightforward way to answer the CTQ is using traditional spatio-temporal indexes.  ...  More specifically, we use a quadtree to partition user movement traces w.r.t. space and time, and then exploit these space-time mapping of user traces to group users using an R-tree.  ...  The space is partitioned into overlapping zones which are indexed using SEB-tree considering only start and end timestamps. The moving objects are mapped to their zones using hashing.  ... 
arXiv:2006.12812v4 fatcat:qodulbilnjbydomw2mhbqjx3fq

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space
한정된 저장 공간상에서 이동 객체 궤적들에 대한 개선된 분할 알고리즘에 관한 연구

Ju-Hyun Park, Woo-Hyun Cho
2010 The Journal of the Korean Institute of Information and Communication Engineering  
Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query.  ...  In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space.  ...  Roussopoulos, "SEB-tree: An Approach to Index Continuously Moving Objects", Proc of The 4th International Conference on Mobile Data Management, pp. 340-344, 2003 [ 9 ] V. P. Chakka, A. C.  ... 
doi:10.6109/jkiice.2010.14.9.2057 fatcat:6gmzr6gpfbap3lknb33lzce2kq

TrajStore: An adaptive storage system for very large trajectory data sets

Philippe Cudre-Mauroux, Eugene Wu, Samuel Madden
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
TrajStore maintains an optimal index on the data and dynamically co-locates and compresses spatially and temporally adjacent segments on disk.  ...  By letting the storage layer evolve with the index, the system adapts to incoming queries and data and is able to answer most queries via a very limited number of I/Os, even when the queries target regions  ...  Index Construction As our system continually receives trajectory data from a fleet of moving objects, we have devised an efficient, iterative mechanism to maintain an optimal index in the presence of frequent  ... 
doi:10.1109/icde.2010.5447829 dblp:conf/icde/Cudre-MaurouxWM10 fatcat:yoxamkkb4zdfzcvppx5tf6snvi

Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations

Jinfeng Ni, Chinya V. Ravishankar
2007 IEEE Transactions on Knowledge and Data Engineering  
Complex queries on trajectory data are increasingly common in applications involving moving objects.  ...  Compared to MVR-trees, PA-trees are an order of magnitude faster to construct and incur I/O cost for spatio-temporal range queries lower by a factor of 2-4.  ...  Within a zone, objects are indexed in an SEB-tree by their start and end timestamps.  ... 
doi:10.1109/tkde.2007.1006 fatcat:mlc5nrpo3zdwpdg26r6fczzxbm

Query the trajectory based on the precise track: a Bloom filter-based approach

Zengjie Wang, Wen Luo, Linwang Yuan, Hong Gao, Fan Wu, Xu Hu, Zhaoyuan Yu
2021 Geoinformatica  
The results verified that the performance and stability of our method, compared to R*tree index, have been improved by 2000 to 4000 times, based on one million to tens of millions of trajectory data.  ...  The current trajectory query methods commonly use the tree-based index structure and the signature-based method to classify, simplify, and filter the trajectory to improve the performance.  ...  SEB-Tree index structure tries to represent trajectory segments by their start and ends timestamp within a spatial grid.  ... 
doi:10.1007/s10707-021-00433-2 pmid:33746566 pmcid:PMC7957281 fatcat:2lamqzoyundcnj2vfjors6n24e

Pointwise-Dense Region Queries in Spatio-temporal Databases

Jinfeng Ni, Chinya V. Ravishankar
2007 2007 IEEE 23rd International Conference on Data Engineering  
Given a set of moving objects, an edge length l, a density threshold ρ, and a timestamp q t , the snapshot PDR query (ρ, l, q t ) requests all regions that are ρ-dense with respect to l-square neighborhoods  ...  Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects.  ...  Work on indexing of historical trajectory includes TB-tree [15] , MVR-tree [5] , SEB-tree [17] , SETI [2] and PA-tree [11] .  ... 
doi:10.1109/icde.2007.368965 dblp:conf/icde/NiR07 fatcat:pcybkkblzjfcjkhkjoleqdpfhu

Moving Objects in Networks Databases [chapter]

Victor Teixeira de Almeida
2006 Lecture Notes in Computer Science  
As an example, the works in [72, 137] present an approach to splitting a moving object trajectory into pieces before indexing it, without considering that this is not possible using traditional indexing  ...  This approach is restricted to moving point objects, which is clearly the most important type of moving objects.  ...  In this chapter, we propose a storage schema with a set of index structures to support an efficient execution of a slightly modified version of the Dijkstra's algorithm.  ... 
doi:10.1007/11896548_8 fatcat:iim3mtyzpveynh4rnpgub2g57u

GeoSOT-Based Spatiotemporal Index of Massive Trajectory Data

Chunyao Qian, Chao Yi, Chengqi Cheng, Guoliang Pu, Xiaofeng Wei, Huangchuang Zhang
2019 ISPRS International Journal of Geo-Information  
To solve this problem, we propose a new spatiotemporal indexing method to improve the query efficiency of massive trajectory data.  ...  By comparing the range query efficiency and scalability of our index with those of the other two space–time composite indexes, we found that our approach improves query efficiency levels by approximately  ...  With this approach, the index will not be updated as long as the moving object does not exceed the space-time unit.  ... 
doi:10.3390/ijgi8060284 fatcat:7p2iglztf5c65cgbhojuzehtby

A Framework for Moving Sensor Data Query and Retrieval of Dynamic Atmospheric Events [chapter]

Shen-Shyang Ho, Wenqing Tang, W. Timothy Liu, Markus Schneider
2010 Lecture Notes in Computer Science  
The problem can be formulated as a spatiotemporal join query to identify the spatio-temporal location where moving sensor objects and dynamic atmospheric event objects intersect, either precisely or within  ...  In this paper, we describe an efficient query and retrieval framework to handle the problem of identifying the spatio-temporal intersecting positions for satellite sensor data retrieval.  ...  For selection and nearest neighbor queries for objects in O c , one can use an index structure such as TB-tree [15] or SEB-tree [16] .  ... 
doi:10.1007/978-3-642-13818-8_9 fatcat:6etourru2jdalc6yyrjdq55ihy

Semantic Trajectories:Computing and Understanding Mobility Data

Zhixian Yan
for the past Spatiotemporal index for the current Spatiotemporal index for the future Spatial access method Temporal access method SETI SEB-tree VCI PR-tree TPR-tree Overlapped B-tree  ...  In our online setting, each local server continuously collects the status updates of moving objects that move inside an area of interest, i.e., the monitoring area of moving objects.  ...  The accuracy of the resulting model was then computed using an 8-fold cross validation approach (we used 80% of the HA instances for training and 20% for testing).  ... 
doi:10.5075/epfl-thesis-5144 fatcat:l4f6jr5frnei3ekpqdh3zj5kda

Supporting scalable data analytics on large linked data

Wangchao Le
While tracking the evolution of schema for linked data is hard, keyword search is an ideal tool to perform data integration.  ...  To cope with the ever-increasing data, we have investigated how to partition and store large temporal or multiversion linked data for distributed and parallel computation, in an effort to achieve load-balancing  ...  The Seb-tree uses the B-tree as the only building block and hence is especially appealing in practice due to its simplicity.  ... 
doi:10.26053/0h-m978-m1g0 fatcat:wqdiw7oj7nchjf4yftsl5gcwvq