ACM Home Page
Please provide us with feedback. Feedback
Adaptive location constraint processing
Full text PdfPdf (341 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2007 ACM SIGMOD international conference on Management of data table of contents
Beijing, China
SESSION: Spatio-temporal data management table of contents
Pages: 581 - 592  
Year of Publication: 2007
ISBN:978-1-59593-686-8
Authors
Zhengdao Xu  University of Toronto, Toronto, ON, Canada
Arno Jacobsen  University of Toronto, Toronto, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 134,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1247480.1247545
What is a DOI?

ABSTRACT

An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of objects is in a spatial constellation or in a spatial constellation relative to a given point of demarcation in the environment. We represent proximity relations as location constraints, which resemble standing queries over continuously changing location position information. The challenge lies in the continuous processing of large numbers of location constraints as the location of objects and the constraint load change. In this paper, we propose an adaptive location constraint indexing approach which adapts as the constraint load and movement pattern of the objects change. The approach takes correlations between constraints into account to further reduce processing time. We also introduce a new location update policy that detects constraint matches with fewer location update requests. Our approach stabilizes system performance, avoids oscillation, reduces constraint matching time by 70% for in-memory processing, and reduces secondary storage accesses by 80% for I/O-incurring environments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
New and Enhanced Features of FedEx InSight, http://www.fedex.com/us/
 
2
Radio Frequency Identification Systems (RFID), http://www.ti.com/rfid/
 
3
P. K. Agarwal and L. Arge and J. Erickson, Indexing Moving Points, In Proc. ACM PODS, 2000.
 
4
Julien Basch, Kinetic Data Structures, Ph.D. thesis, Stanford University, Computer Science Dept., 1999.
5
 
6
Elisa Bertino, Barbara Catania, and Boris Chidlovskii. Indexing Constraint Databases by Using a Dual Representation. In Proc. ICDE, 1999.
 
7
Richard L. Burden and J. Douglas Faires. Numerical analysis. Brooks/Cole Publishing Company, 2000.
8
 
9
Haibo Hu, Jianliang Xu, and Dik Lun Lee. A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects. In Proc. ACM SIGMOD, 2005.
10
11
 
12
Gabriel Kuper, Leonid Libkin, and Jan Paredaens. Constraint databases. Springer Verlag, 2000.
 
13
J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The grid file: An adaptable, symmetric multikey file structure. In ACM Trans. Database systems, 1984.
 
14
15
16
 
17
T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The R-Tree: A Dynamic Index for Multi-Dimensional Objects. In The VLDB Journal, 1987.
 
18
A. Amir. A. Efrat. J. Myllymaki. L. Palaniappan. K. Wampler. Buddy tracking - efficient proximity detection among mobile friends. In INFOCOM, 2004.
19
 
20
E. Welzl. Smallest Enclosing Disks (Balls and Ellipsoids). In New Results and New Trends in Computer Science. Springer, 1991.
 
21
Kun-Lung Wu, Shyh-Kwei Chen, and Philip S. Yu. Efficient Processing of Continual Range Queries for Location-Aware Mobile Services. In Information Systems Frontiers, 2005.
 
22
Z. Xu and H. A. Jacobsen. Evaluating proximity relations under uncertainty. In Proc. ICDE, 2007.
 
23
Z. Xu and H. A. Jacobsen. Efficient constraint processing for highly personalized location based services. In Proc. VLDB04, 2004.
24
 
25
Z. Xu and H. A. Jacobsen. Proximity Relation Processing With Evolving Environment. Technical Report, University of Toronto, www.cs.toronto.edu/~zhengdao/report/CSRG-552.pdf, 2007.
 
26
X. Yu, K. Q. Pu, and N. Koudas. Monitoring k-Nearest Neighbor Queries over Moving Objects. In Proc. ICDE, 2005.
27
 
28
Y. Zhao. Standardization of mobile phone positioning for 3G systems. IEEE Communication Magazine, 2002.


Collaborative Colleagues:
Zhengdao Xu: colleagues
Arno Jacobsen: colleagues