Abstract
primary functionality of context aware applications is the retrieval of different types of context data from various context sources and adapting their behavior accordingly. In order to facilitate context aware application development, a context aware middleware must provide an effective context data management and lookup strategy. The use of a traditional index for indexing dynamic context data is not feasible due to the high update overhead. In this paper, we propose a context data indexing mechanism that utilizes the statistical properties of data viz. the mean and variance to cluster similar data values together and minimizes the need for frequent index updates. Experimental results indicate that the performance of the proposed index structure is satisfactory with respect to the query response time and query accuracy together with a low maintenance overhead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldauf, M., Dustdar, S., Rosenberg, F.: A survey on context-aware systems. IJAHUC, 263–277 (2007)
Kjær, K.E.: A survey of context-aware middleware. In: 25th Conference on IASTED International Multi-Conference (2007)
Dey, A.K.: Understanding and Using Context. Personal and Ubiquitous Computing, 4–7 (2001)
Context-Aware Middleware Services and Programming Support for Sentient Computing, http://lucan.ddns.comp.nus.edu.sg:8080/PublicNSS/researchContextAware.aspx
Xia, Y., Cheng, R., Prabhakar, S., Lei, S., Shah, R.: Indexing continuously changing data with mean-variance tree. IJHPCN, 263–272 (2008)
Xue, W., Pung, H.K., Ng, W.L., Gu, T.: Data Management for Context-Aware Computing. In: EUC (1), pp. 492–498 (2008)
Hartigan, J.A.: Clustering Algorithms. Wiley. New York (1975)
Intel Lab Data, db.csail.mit.edu/labdata/labdata.html
Silva, Y.N., Xiong, X., Aref, W.G.: The RUM-tree: supporting frequent updates in R-trees using memos. VLDB J, 719–738 (2009)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: SIGMOD Conference, pp. 331–342 (2000)
Dyo, V., Mascolo, C.: Adaptive Distributed Indexing for Spatial Queries in Sensor Networks. In: DEXA Workshops, pp. 1103–1107 (2005)
Diao, Y., Ganesan, D., Mathur, G., Shenoy, P.J.: Rethinking Data Management for Storage-centric Sensor Networks. In: CIDR, pp. 22–31 (2007)
Cheng, R., Singh, S., Prabhakar, S.: U-DBMS: A Database System for Managing Constantly-Evolving Data. In: VLDB 1271–1274 (2005)
Gao, J., Steenkiste, P.: An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems. In: ICNP, pp. 239–250 (2004)
Li, D., Cao, J., Lu, X., Chen, K.: Efficient Range Query Processing in Peer-to-Peer Systems. IEEE Trans. Knowl. Data Eng, 78–91 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sen, S., Pung, H.K. (2012). A Mean-Variance Based Index for Dynamic Context Data Lookup. In: Puiatti, A., Gu, T. (eds) Mobile and Ubiquitous Systems: Computing, Networking, and Services. MobiQuitous 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30973-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-30973-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30972-4
Online ISBN: 978-3-642-30973-1
eBook Packages: Computer ScienceComputer Science (R0)