Efficient and Scalable Spatial Retrieval of Resident Involvement Information in City Events

Information about resident involvement in reporting various city-related events (e.g., Potholes, traffic jams) via mobile apps is critical to key stakeholders for effective city management. While existing efforts have primarily focused on event data collection in space, they are not capable of performing efficient retrieval of information about resident involvement in event reporting across different spatial regions and at different spatial granularities. Hence, this work makes the following contributions. First, we present CRIS, a scalable system for efficient retrieval of resident involvement and event information across different spatial regions and at varying spatial granularities. Second, we propose the euR-tree, a novel R-tree-based index augmented with (a) a hash-based array for indexing events in space, and (b) fixed-length arrays for indexing resident involvement information in reporting events in space. The euR-tree is integrated into CRIS to realize efficient retrieval. Third, our performance study indicates that the euR-tree is indeed effective in performing such retrieval with reduced query response times and disk I/Os.

[1]  Prem Prakash Jayaraman,et al.  CARDAP: A Scalable Energy-Efficient Context Aware Distributed Mobile Data Analytics Platform for the Fog , 2014, ADBIS.

[2]  Sukho Lee,et al.  Indexing the current positions of moving objects using the lazy update R-tree , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[3]  Dimitris Papadias,et al.  Processing and optimization of multiway spatial joins using R-trees , 1999, PODS '99.

[4]  Naphtali Rishe,et al.  Benefit and Pricing of Spatio-Temporal Information in Mobile Peer-to-Peer Networks , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[5]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[6]  Beng Chin Ooi,et al.  R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases , 2001, GIS '01.

[7]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[8]  Walid G. Aref,et al.  Spatio-Temporal Access Methods: Part 2 (2003 - 2010) , 2010, IEEE Data Eng. Bull..

[9]  Ramachandran Ramjee,et al.  Nericell: rich monitoring of road and traffic conditions using mobile smartphones , 2008, SenSys '08.

[10]  R. Nigel Horspool,et al.  Practical Perfect Hashing , 1985, Comput. J..

[11]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[12]  Anirban Mondal,et al.  E-VeT: Economic Reward/Penalty-Based System for Vehicular Traffic Management , 2014, 2014 IEEE 15th International Conference on Mobile Data Management.

[13]  Arkady B. Zaslavsky,et al.  Sensing as a service model for smart cities supported by Internet of Things , 2013, Trans. Emerg. Telecommun. Technol..

[14]  Douglas C. Schmidt,et al.  GPERF: A Perfect Hash Function Generator , 1990, C++ Conference.

[15]  Anirban Mondal,et al.  CityZen: A Cost-Effective City Management System with Incentive-Driven Resident Engagement , 2014, 2014 IEEE 15th International Conference on Mobile Data Management.

[16]  Mohit Jain,et al.  Speed-Breaker Early Warning System , 2012, NSDR.

[17]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[18]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[19]  John F. Roddick,et al.  Survey of Spatio-Temporal Databases , 1999, GeoInformatica.

[20]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[21]  Scott T. Leutenegger,et al.  Master-client R-trees: a new parallel R-tree architecture , 1999, Proceedings. Eleventh International Conference on Scientific and Statistical Database Management.

[22]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[23]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.