TY - JOUR
T1 - Location-dependent spatial query containment
AU - Lee, Ken C.K.
AU - Unger, Brandon
AU - Zheng, Baihua
AU - Lee, Wang Chien
N1 - Funding Information:
Wang-Chien Lee received the BS degree from the Information Science Department, National Chiao Tung University, Taiwan, the MS degree from the Computer Science Department, Indiana University, and the Ph.D. degree from the Computer and Information Science Department, the Ohio State University. He is an associate professor of computer science and engineering at The Pennsylvania State University. Prior to joining Penn State, he was a principal member of the technical staff at Verizon/GTE Laboratories, Inc. He leads the Pervasive Data Access (PDA) Research Group at Penn State University to pursue cross-area research in database systems, pervasive/mobile computing, and networking. He is particularly interested in developing data management techniques (including accessing, indexing, caching, aggregation, dissemination, and query processing) for supporting complex queries in a wide spectrum of networking and mobile environments such as peer-to-peer networks, mobile ad hoc networks, wireless sensor networks, and wireless broadcast systems. Meanwhile, he has worked on XML, security, information integration/retrieval, and object-oriented databases. He has published more than 160 technical papers on these topics. His research has been supported by multiple US National Science Foundation (NSF) grants. Most of his research results have been published in prestigious journals and conferences in the fields of databases, mobile computing, and networking. He has been active in various IEEE/ACM conferences and has given tutorials for many major conferences. He was the founding program co-chair of the International Conference on Mobile Data Management (MDM). He has also served as a guest editor for several journal special issues (e.g., IEEE Transactions on Computers) on mobile database related topics. He has served as the TPC chair or general chair for a number of conferences, including the Second International Conference on Scalable Information Systems (Infoscale07), the Sixth International ACM Workshop on Data Engineering for Wireless and Mobile Access (MobiDE07), the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC08). He is currently serving as the TPC chairfor the Tenth International Conference on Mobile Data Management (MDM09). He is a member of the IEEE Computer Society.
PY - 2011/10
Y1 - 2011/10
N2 - Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Q′ is completely covered by that of another LDSQ Q previously answered by a server (denoted by Q′ ⊆ Q) and to answer Q′ locally if Q′ ⊆ Q. Thus, many LDSQs can be reduced from server evaluation. To support LDSQ containment, we propose a notion of containment scope, which represents a spatial area corresponding to an LDSQ result wherein all semantically matched LDSQs are answerable with the result. Through a comprehensive simulation, our proposed approach significantly outperforms existing techniques.
AB - Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Q′ is completely covered by that of another LDSQ Q previously answered by a server (denoted by Q′ ⊆ Q) and to answer Q′ locally if Q′ ⊆ Q. Thus, many LDSQs can be reduced from server evaluation. To support LDSQ containment, we propose a notion of containment scope, which represents a spatial area corresponding to an LDSQ result wherein all semantically matched LDSQs are answerable with the result. Through a comprehensive simulation, our proposed approach significantly outperforms existing techniques.
UR - http://www.scopus.com/inward/record.url?scp=80051802774&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051802774&partnerID=8YFLogxK
U2 - 10.1016/j.datak.2011.06.001
DO - 10.1016/j.datak.2011.06.001
M3 - Article
AN - SCOPUS:80051802774
SN - 0169-023X
VL - 70
SP - 842
EP - 865
JO - Data and Knowledge Engineering
JF - Data and Knowledge Engineering
IS - 10
ER -