1 Copyright © 2003 KAIST All Rights Reserved. Using Semantic Caching to Manage Location Dependent Data in Mobile Computing 2003.3.18 CS 744 Database Lab.

Slides:

Advertisements

Similar presentations

Traffic Models: Status/Discussion July 22, 2003 N. K. Shankaranarayanan (Shankar) AT&T Labs-Research IEEE C /73.

Advertisements

1 Processamento de Consultas Espaciais Baseado em Cache Semântico Dependente de Localização Heloise Manica Murilo S. de Camargo Cristina Dutra de Aguiar.

Semantic Data Caching and Replacement. Outline Motivation Client Caching Architecture Model of Semantic Caching Simulations and Results Conclusion and.

CS4432: Database Systems II

Alternative Models for Online Analysis Alex López-Ortiz University of Waterloo joint work with Reza Dorrigiv, Spyros Angelopoulos and Ian Munro.

Database Management Systems 3ed, R. Ramakrishnan and Johannes Gehrke1 Evaluation of Relational Operations: Other Techniques Chapter 14, Part B.

Database Management Systems, R. Ramakrishnan and Johannes Gehrke1 Evaluation of Relational Operations: Other Techniques Chapter 12, Part B.

Database Systems: Design, Implementation, and Management Eighth Edition Chapter 6 Advanced Data Modeling.

Database Systems: Design, Implementation, and Management Tenth Edition

BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 6 Advanced Data Modeling.

Some contributions to the management of data in grids Lionel Brunie National Institute of Applied Science (INSA) LIRIS Laboratory/DRIM Team – UMR CNRS.

1 8. Safe Query Languages Safe program – its semantics can be at least partially computed on any valid database input. Safety is tied to program verification,

Spatial Outlier Detection and implementation in Weka Implemented by: Shan Huang Jisu Oh CSCI8715 Class Project, April Presented by Jisu.

1 Location Information Management and Moving Object Databases “Moving Object Databases: Issues and Solutions” Ouri, Bo, Sam and Liqin.

Query Execution :Nested-Loop Joins Rohit Deshmukh ID 120 CS-257 Rohit Deshmukh ID 120 CS-257.

Chapter 6 Wireless and Mobile Networks. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2.

ECE7995 Caching and Prefetching Techniques in Computer Systems Lecture 8: Buffer Cache in Main Memory (IV)

7DS Seven Degrees of Separation Suman Srinivasan IRT Lab Columbia University.

CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.

August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.

Maninder Kaur CACHE MEMORY 24-Nov

Wang, Z., et al. Presented by: Kayla Henneman October 27, 2014 WHO IS HERE: LOCATION AWARE FACE RECOGNITION.

Doc.: IEEE /0126r0 Submission January 2006 Yeong M. Jang, Kookmin University, KoreaSlide 1 Parameters for Network Selection Algorithm under Heterogeneous.

AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.

Massively Distributed Database Systems Broadcasting - Data on air Spring 2014 Ki-Joune Li Pusan National University.

Query Driven Data Collection and Data Forwarding in Intermittently Connected Mobile Sensor Networks Wei WU 1, Hock Beng LIM 2, Kian-Lee TAN 1 1 National.

Processing Monitoring Queries on Mobile Objects Lecture for COMS 587 Department of Computer Science Iowa State University.

AAU A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing Presented by YuQing Zhang  Slobodan Rasetic Jorg Sander James Elding Mario A.

©Silberschatz, Korth and Sudarshan13.1Database System Concepts Chapter 13: Query Processing Overview Measures of Query Cost Selection Operation Sorting.

Decomposing Data-Centric Storage Query Hot-Spots in Sensor Netwokrs Mohamed Aly, Panos K. Chrysanthis, and Kirk Pruhs University of Pittsburgh Proceeding.

Chapter 8 Data Modeling Advanced Concepts Database Principles: Fundamentals of Design, Implementation, and Management Tenth Edition.

Copyright © Curt Hill Query Evaluation Translating a query into action.

Internet Real-Time Laboratory Arezu Moghadam and Suman Srinivasan Columbia University in the city of New York 7DS System Design 7DS system is an architecture.

L/O/G/O Cache Memory Chapter 3 (b) CS.216 Computer Architecture and Organization.

Leonardo Guerreiro Azevedo Geraldo Zimbrão Jano Moreira de Souza Approximate Query Processing in Spatial Databases Using Raster Signatures Federal University.

Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition Copyright © 2004 Pearson Education, Inc. Slide 2-1 Data Models Data Model: A set.

FlexTable: Using a Dynamic Relation Model to Store RDF Data IDS Lab. Seungseok Kang.

Master’s Thesis Semantic Query Caching in Mobile Environments By: Jekkin Shah Advisor: Dr. Konstantinos Kalpakis.

August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.

ENERGY-EFFICIENCY AND STORAGE FLEXIBILITY IN THE BLUE FILE SYSTEM E. B. Nightingale and J. Flinn University of Michigan.

Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.

A BRIEF INTRODUCTION TO CACHE LOCALITY YIN WEI DONG 14 SS.

Massively Distributed Database Systems Broadcasting - Data on air Spring 2015 Ki-Joune Li Pusan National University.

A Semantic Caching Method Based on Linear Constraints Yoshiharu Ishikawa and Hiroyuki Kitagawa University of Tsukuba

Transforming Policies into Mechanisms with Infokernel Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Nathan C. Burnett, Timothy E. Denehy, Thomas J.

Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.

Managing Location Information for Billions of Gizmos on the Move – What’s in it for the Database Folks Ralf Hartmut Güting Fernuniversität Hagen, Germany.

1 Overview of Query Evaluation Chapter Outline  Query Optimization Overview  Algorithm for Relational Operations.

IEEE MEDIA INDEPENDENT HANDOVER DCN: Title: Proposed Presentation for 3GPP Date Submitted: September,

Using Semantic Caching to Manage Location Dependent Data in Mobile Computing Qun Ren, Margaret H. Dunham Presented by Jekkin Shah.

Semantic Data Caching and Replacement

Qiyuan Xing, Jing Wang, Yue Li, Yanbo Han

Database Management Systems (CS 564)

CS222: Principles of Data Management Notes #13 Set operations, Aggregation Instructor: Chen Li.

Kalyan Boggavarapu Lehigh University

Memory Management & Virtual Memory

Goal Control the amount of traffic in the network

Virtual Memory فصل هشتم.

CSE 4340/5349 Mobile Systems Engineering

Performance metrics for caches

Performance metrics for caches

Effective Replica Allocation

Performance metrics for caches

Group Based Management of Distributed File Caches

Overview of Query Evaluation

Evaluation of Relational Operations: Other Techniques

Performance metrics for caches

Spatial Databases: Spatio-Temporal Databases

Donghui Zhang, Tian Xia Northeastern University

Performance metrics for caches

Presentation transcript:

1 Copyright © 2003 KAIST All Rights Reserved. Using Semantic Caching to Manage Location Dependent Data in Mobile Computing CS 744 Database Lab. Se-Kyoung Huh

2 Copyright © 2003 KAIST All Rights Reserved. Contents Background Semantic Cache Modeling LDD Query LDD Semantic Cache Index LDD Query Processing LDD Cache Management Experiment Conclusion

3 Copyright © 2003 KAIST All Rights Reserved. Background Characteristic of mobile computing Large overlapped results for continuous queries Disconnected situation Advantage of caching data for mobile computing Wireless network traffic cost down System performance up

4 Copyright © 2003 KAIST All Rights Reserved. Semantic Cache Semantic Cache vs. Page Cache Advantage of semantic cache for LDD (Location Dependent Data) Strong semantic locality than spatial locality for semantic LDD application Possibility of flexible cache management Use of semantic information in disconnection situations Semantic CachePage Cache GranularityQuery resultDatabase tuples or pages ContentSemantic information + resultresult

5 Copyright © 2003 KAIST All Rights Reserved. Modeling LDD Query Q = “Give me the names of the hotels within 20 miles whose prices are below $100” Qp = (price < 100) ∩ (Lx-20 < xposition <= Lx+20) ∩ (Ly-20 <= yposition < Ly+20) (Lx,Ly) : current user position Assumption : reference point is given Dependent on the current user position

6 Copyright © 2003 KAIST All Rights Reserved. LDD Semantic Cache Index SSRSR SASA SPSP SLSL SCSC S TS S1S1 HotelHname (Lx-5 <=hxpos<=Lx+5)∩ (Ly-5 <=hypos <=Ly+5) 10,202T1 S2S2 Rest. Rname, Type (Lx-10<=rxpos<=Lx+10)∩ (Ly-10 <=rypos <=Ly+10)∩ (6<=sched<=9) -5,155T2 S3S3 HotelHname, Vacancy (Lx-5 <=hxpos<=Lx+5) ∩ (Ly-5<=hypos<=Ly+5) ∩ (Price<100) -5,-208T3 Semantic information TableAttributeBound position Predicate Index for cache result Time Stamp

7 Copyright © 2003 KAIST All Rights Reserved. LDD Query Processing Relationship between query and cache If query is contained by cache Use cache for query processing If query is partly contained by cache Split the query into The query satisfied by cache » by checking through all segment in the cache The query not satisfied by cache Send only the query not satisfied by cache to server Coalesce every partial query result Add new query result into cache Need for decomposition of segments to prevent duplicated cache segment

8 Copyright © 2003 KAIST All Rights Reserved. LDD Cache Management Replacement principle Incorporation of the status of the mobile user The moving direction The distance from cache segment

9 Copyright © 2003 KAIST All Rights Reserved. LDD Cache Management (cont’d) FAR algorithm Divide cache segment In Direction set Segment in the user’s moving direction Out Direction set Segment not in the user’s moving direction Choose the victim among the Out Direction set If Out Direction set is empty Choose the victim the furthest segment in In Direction set

10 Copyright © 2003 KAIST All Rights Reserved. Experiment Page Caching vs. Semantic Caching Database is neither indexed nor clustered Semantic caching is better Due to the highly reduced wireless network traffic Only the required data is transferred

11 Copyright © 2003 KAIST All Rights Reserved. Experiment (cont’d) Page Caching vs. Semantic Caching (cont’d) index on x, column-wise scan clustering Page caching becomes better than one in no index database Due to not necessity of scanning database for finding page

12 Copyright © 2003 KAIST All Rights Reserved. Experiment (cont’d) Page Caching vs. Semantic Caching (cont’d) index on x, column-wise scan clustering Page Caching is sensitive for the organization of database

13 Copyright © 2003 KAIST All Rights Reserved. Experiment (cont’d) Comparison of several replacement policy FAR is better than LRU or MRU

14 Copyright © 2003 KAIST All Rights Reserved. Conclusion Contribution Propose semantic cache concept for mobile computing Weakness Cache replacement policy Always possible for predicting user’s movement direction?