Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Geometric algorithms for message filtering in decentralized virtual environments
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Wireless integrated network sensors
Communications of the ACM
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
Querying the trajectories of on-line mobile objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
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
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Range and kNN query processing for moving objects in grid model
Mobile Networks and Applications
Adaptive location constraint processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Longitude: Centralized Privacy-Preserving Computation of Users' Proximity
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
A New Protocol for the Nearby Friend Problem
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
The VLDB Journal — The International Journal on Very Large Data Bases
Blind chance: on potential trust friends query in mobile social networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Efficient proximity detection among mobile objects in road networks with self-adjustment methods
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A general framework for geo-social query processing
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Global positioning systems (GPS) and mobile phone networks make it possible to track individual users with an increasing accuracy. It is natural to ask whether this information can be used to maintain social networks. In such a network each user wishes to be informed whenever one of a list of other users, called the user's friends, appears in the user's vicinity. In contrast to more traditional positioning based algorithms, the computation here depends not only on the user's own position on a static map, but also on the dynamic position of the user's friends. Hence it requires both communication and computation resources. The computation can be carried out either between the individual users in a peer-to-peer fashion or by centralized servers where computation and data can be collected at one central location. In the peer-to-peer model, a novel algorithm for minimizing the number of location update messages between pairs of friends is presented. We also present an efficient algorithm for the centralized model, based on region hierarchy and quadtrees. The paper provides an analysis of the two algorithms, compares them with a naive approach, and evaluates them on user motions generated by the IBM City Simulator system.