• Title/Summary/Keyword: Mobile Databases

Search Result 168, Processing Time 0.021 seconds

An Efficient Location Cache Scheme for 3-level Database Architecture in PCS Networks (PCS 네트워크에서 3-레벨 데이터베이스 구조를 위한 효과적인 위치 캐시 기법)

  • Han, Youn-Hee;Song, Ui-Sung;Hwang, Chong-Sun;Jeong, Young-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.253-264
    • /
    • 2002
  • Recently, hierarchical architectures of databases for location management have been proposed in order to accommodate the increase in user population in future personal communication systems. In particular, a 3-level hierarchical database architecture is compatible with current cellular mobile systems. In the architecture, a newly developed additional databases, regional location database(RLR), are positioned between HLR and VLRs. We propose an efficient cache scheme, called the Double T-thresholds Location Cache Scheme. The cache scheme extends the existing T-threshold location cache scheme which is competent only under 2-level architecture of location databases currently adopted by IS-41 and GSM. The idea behind our scheme is to use two pieces of cache information, VLR and RLR serving called portables. The two pieces are required in order to exploit root only locality of registration area(RA) but also locality of regional registration area(RRA) which is the wide area covered by RLR. We also use two threshold values in order to determine whether the two pieces are obsolete. In order to model the RRA residence time, the branching Eralng-$\infty$ distribution is introduced. Our minute cost analysis shows that the double T-threshold location cache scheme yields significant reduction of network and database costs for molt patterns of portables.

Signature-based Indexing Scheme for Similar Sub-Trajectory Retrieval of Moving Objects (이동 객체의 유사 부분궤적 검색을 위한 시그니쳐-기반 색인 기법)

  • Shim, Choon-Bo;Chang, Jae-Woo
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.247-258
    • /
    • 2004
  • Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

On Indexing Method for Current Positions of Moving Objects (이동 객체의 현재 위치 색인 기법)

  • Park, Hyun-Kyoo;Kang, Sung-Tak;Kim, Myoung-Ho;Min, Kyoung-Wook
    • Journal of Korea Spatial Information System Society
    • /
    • v.5 no.1 s.9
    • /
    • pp.65-74
    • /
    • 2003
  • Location-based service is an important spatiotemporal database application area that provides the location-aware information of wireless terminals via positioning devices such as GPS. With the rapid advances of wireless communication systems, the requirement of mobile application areas including traffic, mobile commerce and supply chaining management became the center of attention for various research issues in spatiotemporal databases. In this paper we present the A-Quadtree, an efficient indexing method for answering location-based queries where the movement vector information (e.g., speed and velocity) is not presented. We implement the A-Quadtree with an index structure for object identifiers as a.Net component to apply the component to multiplatforms. We present our approach and describe the performance evaluation through various experiments. In our experiments, we compare the performance with previous approaches and show the enhanced efficiency of our method.

  • PDF

Design and Implementation of Navigation Operating System APIs for Set-based POI Search Algorithm (집합 기반 POI 검색을 지원하는 내비게이션 운영체제 기능 설계 및 구현)

  • Ahn, Hyeyeong;Lee, Jongwoo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.3
    • /
    • pp.269-274
    • /
    • 2015
  • As smart device companies such as Google or Apple develop competitive mobile-based automotive operating systems and navigation systems, the range of choice for users in such markets is expanding. Navigation systems equipped with mobile operating systems have increased convenience for users. However, since an API for the POI databases used in navigation systems doesn't exist, the number of applications using POI data is insufficient. In this paper, we designed and implemented system calls for navigation operating systems with a focus on POI search, in order to resolve such limitations. The system calls support set-based POI search functions, and therefore provides solutions to search performance degradation problems caused by false inputs. As a result of performance evaluation, not only did the search performance improve, but there was also no problem in applying APIs in applications.

A Literature Review on Sound Therapy for Tinnitus (이명의 소리치료에 대한 문헌 고찰)

  • Eun Kyung Lee;Hye Yeon Ko;Min Hee Kim
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.36 no.2
    • /
    • pp.45-59
    • /
    • 2023
  • Objectives : The purpose of this study is to analyze the various methods of sound therapy(ST) applied to tinnitus patients and their effectiveness, and to suggest an effective method that can be applied in clinical settings. Methods : Studies published from January 2018 to March 2023 were searched on 5 databases(Pubmed, RISS, OASIS, KISS, KCI). All RCTs that applied sound therapy as a main treatment method were included. Results : 14 studies were included. In 13 studies, sound therapy was statistically significant in improving tinnitus. Basic sound therapy was used in 6 studies(42%), followed by tinnitus rehabilitation therapy(TRT)(n=5, 35%). White noise(n=11, 75%) and nature sound(n=4, 28%) were the most frequently used sound sources. In the case of intensity, mixing point were the most common with 6 studies(42%). The mobile application(n=4) was the most frequently used implement. The application time of sound therapy per day was more than 3 hours(n=7), and the total treatment period was more than 3 months(n=9). Conclusions : Our findings indicate that sound therapy could be considered as an intervention for tinnitus patients. For better use, we suggest a basic type of sound therapy or TRT using white noise or nature sound at the mixing point level provided as a mobile phone application. In addition, the treatment period is recommended to be more than 3 hours/day for 3 months.

A Location Management Scheme Using Gateway in PCN (PCN에서 VLR 게이트웨이를 이용한 위치관리 기법)

  • 박남식;유영철;남궁한;진성일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1444-1455
    • /
    • 1999
  • In the standard location strategy such as IS-41 and GSM, Home Location Register(HLR) and Visitor Location Register(VLR) databases are used to manage the location of mobile terminals. The primary goal that location management schemes investigate is to reduce the cost of database access and the traffic for signaling network. When mobile terminals move frequently, one of problems in the standard location management scheme is that HLR database is highly updated and the traffic in signaling network can be occurred significantly due to high message transfer rate between HRL and VLR. As a solution to these problems, this paper proposes the location management scheme using VLR Gateway(VG) to reduce the both traffics of HLR update and signaling network which are resulted from location registration requirements of mobile terminals whenever they cross their registration area boundary. VG is a kind of database that is placed between HLR and VLR. It integrates one or more registration area defined in a system into one group and plays a role on behalf of HLR in a integrated registration scope so that the call delivery and the movement of mobile terminals are possible without HLR access in the scope. In order to evaluate performance of IS-41 and proposed scheme, we simulate two schemes based on wide range of call to mobility ratio. Its experiment result shows that in the proposed scheme total database cost increased slightly whereas HLR and signaling traffic decreased remarkably.

  • PDF

A Query Processing Technique for XML Fragment Stream using XML Labeling (XML 레이블링을 이용한 XML 조각 스트림에 대한 질의 처리 기법)

  • Lee, Sang-Wook;Kim, Jin;Kang, Hyun-Chul
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.67-83
    • /
    • 2008
  • In order to realize ubiquitous computing, it is essential to efficiently use the resources and the computing power of mobile devices. Among others, memory efficiency, energy efficiency, and processing efficiency are required in executing the softwares embedded in mobile devices. In this paper, query processing over XML data in a mobile device where resources are limited is addressed. In a device with limited amount of memory, the techniques of XML. stream query processing need to be employed to process queries over a large volume of XML data Recently, a technique Galled XFrag was proposed whereby XML data is fragmented with the hole-filler model and streamed in fragments for processing. With XFrag, query processing is possible in the mobile device with limited memory without reconstructing the XML data out of its fragment stream. With the hole-filler model, however, memory efficiency is not high because the additional information on holes and fillers needs to be stored. In this paper, we propose a new technique called XFLab whereby XML data is fragmented with the XML labeling scheme which is for representing the structural relationship in XML data, and streamed in fragments for processing. Through implementation and experiments, XML showed that our XFLab outperformed XFrag both in memory usage and processing time.

An Index Method for Wireless XML Streams (무선 XML 스트림을 위한 색인 기법)

  • Chung, Yon-Dohn;Lee, Ji-Yeon
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.416-428
    • /
    • 2005
  • In the paper we propose an index method for XML streaming services, where a server broadcasts XML data to a lot of clients in wireless information systems. In order to control the access and tuning time of mobile clients, the proposed method constructs the XML stream through replicating partial index intermixed with parts of data. For this purpose, we propose a two-level tree structure for separating index and XML data into two parts: replicated vs. non-replicated. We analyze the performance of the proposed method with respect to access time and tuning time. With the analysis result, we derive the optimal level value.

A Cache Management Scheme for Effective Processing of Continuous Partial Match Queries in Mobile Computing Environments (이동 컴퓨팅 환경에서 연속 부분 부합 질의의 효과적인 처리를 위한 캐시 관리 방안)

  • Jeong, Yeon-Don;Lee, Ji-Yeon;Lee, Yun-Jun;Kim, Myeong-Ho
    • Journal of KIISE:Databases
    • /
    • v.28 no.2
    • /
    • pp.253-265
    • /
    • 2001
  • 본 논문은 이동 컴퓨팅 환경에서 연속 부분 질의의 효과적인 처리를 위한 캐시 관리 방안을 제안한다. 연속 부분 부합 질의란 질의의 결과가 클라이언트의 메모리에 일관성을 유지하면서 지속되는 부분 부합 질의이다. 기존의 이동 환경을 위한 캐시 관리 기법은 레코드 식별자를 기반으로 하는 방법들이다. 하지만, 부분 부합 질의는 데이터의 내용을 기반으로 탐색하는 질의이기 때문에 이러한 레코드 식별자를 기반으로 하는 방법들은 캐시 관리를 효율적으로 할 수 없다. 제안하는 캐시 관리 방안에서는, 이동 클라이언트의 캐시 상태를 프레디킷(predicate)으로 기술하고, 서버가 캐시 관리를 위해 클라이언트에게 방송하는 캐시 무효화 정보, 즉 Cache Invalidation Reports(CIR)을 프레디킷으로 구성한다. 이러한 프레디킷 표현을 사용하여, 일련의 캐시 관리 기법-억지 방법(the brute-force method), 빼기 방법(the subtraction method), 교차 방법(the intersection method)-들을 제안한다. 그리고, 제안하는 방법의 계산 복잡도를 계산한다.

  • PDF

A Structure of Personalized e-Learning System Using On/Off-line Mixed Estimations Based on Multiple-Choice Items

  • Oh, Yong-Sun
    • International Journal of Contents
    • /
    • v.5 no.1
    • /
    • pp.51-55
    • /
    • 2009
  • In this paper, we present a structure of personalized e-Learning system to study for a test formalized by uniform multiple-choice using on/off line mixed estimations as is the case of Driver :s License Test in Korea. Using the system a candidate can study toward the license through the Internet (and/or mobile instruments) within the personalized concept based on IRT(item response theory). The system accurately estimates user's ability parameter and dynamically offers optimal evaluation problems and learning contents according to the estimated ability so that the user can take possession of the license in shorter time. In order to establish the personalized e-Learning concepts, we build up 3 databases and 2 agents in this system. Content DB maintains learning contents for studying toward the license as the shape of objects separated by concept-unit. Item-bank DB manages items with their parameters such as difficulties, discriminations, and guessing factors, which are firmly related to the learning contents in Content DB through the concept of object parameters. User profile DB maintains users' status information, item responses, and ability parameters. With these DB formations, Interface agent processes user ID, password, status information, and various queries generated by learners. In addition, it hooks up user's item response with Selection & Feedback agent. On the other hand, Selection & Feedback agent offers problems and content objects according to the corresponding user's ability parameter, and re-estimates the ability parameter to activate dynamic personalized learning situation and so forth.