Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers

Research Article

CAWA: Continuous Approximate Where-About Queries

Download70 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-10485-5_18,
        author={Alexander Aved and Kien Hua and Antoniya Petkova},
        title={CAWA: Continuous Approximate Where-About Queries},
        proceedings={Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers},
        proceedings_a={INFOSCALE},
        year={2012},
        month={5},
        keywords={Moving object database continuous query presence distributed computing where-about},
        doi={10.1007/978-3-642-10485-5_18}
    }
    
  • Alexander Aved
    Kien Hua
    Antoniya Petkova
    Year: 2012
    CAWA: Continuous Approximate Where-About Queries
    INFOSCALE
    Springer
    DOI: 10.1007/978-3-642-10485-5_18
Alexander Aved1,*, Kien Hua1,*, Antoniya Petkova1,*
  • 1: School of EECS
*Contact email: aaved@eecs.ucf.edu, kienhua@eecs.ucf.edu, apetkova@eecs.ucf.edu

Abstract

With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been extensively studied. While current systems are concerned with tracing the precise location, or paths, of these objects, in many cases it is sufficient to know that the approximate location or path of a moving object is, with certainty, within known bounds. Thus, we present our work on Continuous Approximate Where-About (CAWA) queries, in which mobile sensors sense the presence of an object (not its precise location) and query servers deduce the object’s where-about area from mobile sensor presence updates.