A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Indexing Moving Points
2003
Journal of computer and system sciences (Print)
Preserved Fulltext
We obtain a tradeoff between the query time and the number of times the index needs to be updated as the points move. ...
Finally, we develop an efficient indexing scheme to answer approximate nearest-neighbor queries among moving points. r ...
Our results This paper contains four main results on indexing moving points in the plane. ...
doi:10.1016/s0022-0000(02)00035-1
fatcat:yc7hyg6jdffefl22qdexmljfbi
Indexing moving points (extended abstract)
2000
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we develop an e cient indexing scheme to answer approximate nearest-neighbor queries among moving points. ...
We obtain a tradeo between the query time and the number of times the index needs to be updated as the points move. ...
Develop e cient indexing schemes for points moving along nonlinear trajectories.
2. Develop an e cient indexing scheme for answering exact nearest-neighbor queries. 3. ...
doi:10.1145/335168.335220
dblp:conf/pods/AgarwalAE00
fatcat:g7cmr7zn7vbspokk4gx37gr3fe
ALTERNATIVE METHODOLOGIES FOR THE ESTIMATION OF LOCAL POINT DENSITY INDEX: MOVING TOWARDS ADAPTIVE LIDAR DATA PROCESSING
2012
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to resolve the drawbacks of these methods, this paper proposes several approaches for the estimation of the local point density index which take the 3D relationship among the points and the physical ...
In the simplest approach, an approximate value of the local point density for each point is defined while considering the 3D relationship among the points. ...
The local point density index for each point is then estimated by inversing the area of the Voronoi polygon assigned to that point. ...
doi:10.5194/isprsarchives-xxxix-b3-127-2012
fatcat:ovsogm4csneiflgnjsdiemgwiq
Review of Spatiotemporal Data Indexing Structures
2015
CVR Journal of Science & Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Efficient processing of the spatiotemporal data needs sophisticated indexing schemes. Many indexing structures are available in the literature for accessing such data sets. ...
This paper provides a comprehensive survey, classification and brief description of spatiotemporal data indexing structures for efficient accessing of the data by various types of spatiotemporal queries ...
Polar-tree [2] is used to index orientations of moving objects to a given focal point to detect the objects which get closer or move away from the focal point. ...
doi:10.32377/cvrjst0801
fatcat:4ndnq465lbaajfyld4bwbnvd54
TMOM: A Moving Object Main Memory-Based DBMS for Telematics Services
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
object data Related Works Index of moving objects Researches related to the index of moving objects are largely di vided into three categories Indexes for searching present and future location • R-tree ...
, Quad-tree and TPR-tree Indexes for searching past location • 3DR-tree, HR-tree and MV3R-tree Indexes for the movement of moving objects • STR-tree, TB-tree and CR-tree (Combined R-tree) Indexes for high ...
doi:10.1007/11935148_24
fatcat:zr2zphzuijgjdkpybhzny4stla
Indexing of real time geospatial data by IoT enabled devices: Opportunities, challenges and design considerations
2020
Journal of Ambient Intelligence and Smart Environments
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Some major challenges relevant to indexing of moving objects are highlighted. Various important index design considerations are also discussed. ...
Wide range of location-based services and sensors in GIS have to manage moving objects that change their position with respect to time. ...
Moving, points
None
None
Single
machine
None
Yes
None
None
[103]
2002 tree-
based
Moving, points
None
None
Single
machine
None
None
None
None
[175]
2008 tree-
based
Moving ...
doi:10.3233/ais-200565
fatcat:guzi2qgf4balhcvjnhlcnqjuru
DTNH Indexing Method: Past Present and Future Data Prediction for Spatio-Temporal Data
2017
International Journal of Intelligent Engineering and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The D-Tree indexing is used to get the spatial data and manage the moving objects in the road network. A set of TB*-Tree is used to index the history of moving object on road networks. ...
Indexing methods are developed to effectively process user queries in many real-time and moving object management applications. ...
indexing is used index all the points of indexing methods that is index the past, present and future data prediction of indexing method. ...
doi:10.22266/ijies2017.0630.48
fatcat:blrerjltxvdstmzxnazqv6dqcu
Real-Time Spatial Queries for Moving Objects Using Storm Topology
2016
ISPRS International Journal of Geo-Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using this approach, we compare the range and K-nearest neighbor (KNN) query efficiency of four spatial indexes on a single dataset and introduce a method of performing spatial joins between two moving ...
In particular, we build a secondary distributed index for spatial join queries based on the grid-partition index. ...
KNN Query: Suppose that there is a given set of moving points represented by O and that a query point q is specified. ...
doi:10.3390/ijgi5100178
fatcat:jzlxahk3pbbw7kvudw3fpfvnjy
An query processing for continuous K-nearest neighbor based on R-Tree and Quad Tree
2010
2010 3rd International Conference on Computer Science and Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the interested region, it uses the QR-Tree and hash tables as an index to store the moving object, and then calculates the distances between the query point and the moving objects to get the result. ...
, in which the main idea is to use a QR-Tree to divide the static spatial space for the moving objects. ...
We use the MOQ-QR tree to present the moving objects and moving query. Moving objects and query points as opposite angle point to construct a MBR. ...
doi:10.1109/iccsit.2010.5563984
fatcat:u63xjct2dreifhufiypfhop45u
Page 12 of The American Statistician Vol. 9, Issue 3
[page]
1955
The American Statistician
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The ‘turning points” for these indexes are not cyclical turning points, but actual reversals of direction, or reversals in the direction of the moving averages. ...
of these points. ...
Moving Object Databases-Indexing Algorithms
2014
Journal of clean energy technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The achieved improvements concerning indexing methods in moving object databases, which is a very popular subject, will surely provide enormous benefits to the pertinent technology field. ...
The methods which can explain the concept of change in the space regarding time found place among moving object databases. ...
of movement as time dependent moving point and moving region. ...
doi:10.7763/ijcte.2014.v6.909
fatcat:n3rrtcubsvbjnapexiclpdofae
Indexing the Positions of Continuously Moving Objects
[chapter]
2016
Encyclopedia of GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. ...
The present paper proposes a novel, R £ -tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. ...
We propose an indexing technique, the time-parameterized R-tree (the TPR-tree, for short), which efficiently indexes the current and anticipated future positions of moving point objects (or "moving points ...
doi:10.1007/978-3-319-23519-6_618-2
fatcat:sqvhehwgs5aqro56tjrgue5ok4
Indexing the positions of continuously moving objects
2000
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. ...
The present paper proposes a novel, R £ -tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. ...
We propose an indexing technique, the time-parameterized R-tree (the TPR-tree, for short), which efficiently indexes the current and anticipated future positions of moving point objects (or "moving points ...
doi:10.1145/335191.335427
fatcat:vgczixm3qrehzejsrrrrkvjkfm
Indexing the positions of continuously moving objects
2000
Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. ...
The present paper proposes a novel, R £ -tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. ...
We propose an indexing technique, the time-parameterized R-tree (the TPR-tree, for short), which efficiently indexes the current and anticipated future positions of moving point objects (or "moving points ...
doi:10.1145/342009.335427
dblp:conf/sigmod/SaltenisJLL00
fatcat:f4a5jpymobhjvdpfc4vs5dffmy
Indexing the Positions of Continuously Moving Objects
[chapter]
2008
Encyclopedia of GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. ...
The present paper proposes a novel, R £ -tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. ...
We propose an indexing technique, the time-parameterized R-tree (the TPR-tree, for short), which efficiently indexes the current and anticipated future positions of moving point objects (or "moving points ...
doi:10.1007/978-0-387-35973-1_618
fatcat:xv37p64fwrfatbw4dulpfoyibm
« Previous
Showing results 1 — 15 out of 1,555,435 results