• Title/Summary/Keyword: Mobile Databases

Search Result 168, Processing Time 0.022 seconds

Flash Memory Shadow Paging Scheme Using Deferred Cleaning List for Portable Databases (휴대용 데이터베이스를 위한 지연된 소거 리스트를 이용하는 플래시 메모리 쉐도우 페이징 기법)

  • Byun Si-Woo
    • Journal of Information Technology Applications and Management
    • /
    • v.13 no.2
    • /
    • pp.115-126
    • /
    • 2006
  • Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. We propose a new transaction recovery scheme for a flash memory database environment which is based on a flash media file system. We improved traditional shadow paging schemes by reusing old data pages which are supposed to be invalidated in the course of writing a new data page in the flash file system environment. In order to reuse these data pages, we exploit deferred cleaning list structure in our flash memory shadow paging (FMSP) scheme. FMSP scheme removes the additional storage overhead for keeping shadow pages and minimizes the I/O performance degradation caused by data page distribution phenomena of traditional shadow paging schemes. We also propose a simulation model to show the performance of FMSP. Based on the results of the performance evaluation, we conclude that FMSP outperforms the traditional scheme.

  • PDF

CareMyDog: Pet Dog Disease Information System with PFCM Inference for Pre-diagnosis by Caregiver

  • Kim, Kwang Baek;Song, Doo Heon;Park, Hyun Jun
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.1
    • /
    • pp.29-35
    • /
    • 2021
  • While the population of pet dogs and pet-related markets are increasing, there is no convenient and reliable tool for pet health monitoring for pet owners/caregivers. In this paper, we propose a mobile platform-based pre-diagnosis system that pet owners can use for pre-diagnosis and obtaining information on coping strategies based on their observations of the pet dog's abnormal behavior. The proposed system constructs symptom-disease association databases for 100 frequently observed diseases under veterinarian guidance. Then, we apply the possibilistic fuzzy C-means algorithm to form the "probable disease" set and the "doubtable disease" set from the database. In the experiment, we found that the proposed system found almost all diseases correctly, with an average of 4.5 input symptoms and outputs 1.5 probable and one doubtable disease on average. The utility of this system is to alert the owner's attention to the pet dog's abnormal behavior and obtain an appropriate coping strategy before consult a veterinarian.

A Systematic Review of Mobile Health Applications Using Self-Acupressure (자가혈위지압을 활용한 모바일 의료 어플에 대한 체계적 문헌고찰)

  • Seokyung Park;Johyun Lee;Ga-Young Jung;Celine Jang;Sang-Ho Kim
    • Korean Journal of Acupuncture
    • /
    • v.40 no.1
    • /
    • pp.1-12
    • /
    • 2023
  • Objectives : This study aims to provide information regarding the status and quality of mobile applications (MAs) using self-acupressure by performing a systematic review. Methods : We conducted comprehensive searching on five international databases and two app markets from inception to July 31, 2022 to identify MAs using self-acupressure. We analyzed the characteristics of each MA regarding the name of the MA, registered app markets, target symptoms, developers, the year and country of development, cost, target age, media function, and expertise. We assessed the quality of each MA using Mobile Application Rating Scale (MARS). Results : We identified a total of 30 MAs using self-acupressure (25 MAs from the app market and 6 MAs from clinical studies, with 1 MA in common). 17 out of 24 MAs from the app market provided self-acupressure regimens for various symptoms and the others provided regimens for specific symptoms such as memory, anxiety, depression, asthma, allergy, low back pain, and headache. 14 developers were reported. 23 MAs were developed after 2013. The largest number of MAs were developed in the United States. The target age group of 12 MAs was above the age of 3, and that of 11 MAs was above the age of 12. 14 MAs provided multimedia functions such as videos. 13 MAs provided information of expertise. From clinical studies, only 3 out of 6 MAs were accessible through the app market. 4 MAs were developed by the researchers of the study. In terms of MARS, the score of MAs from the app market was higher than that of MAs from clinical studies in both objective and subjective evaluation areas. Conclusions : This study summarizes the characteristics of MAs using self-acupressure. More MAs using self-acupressure should be developed and further clinical research for MA on each symptom and disease is warranted for the diversification of MA fields using self-acupressure.

Implementation of Storage Manager to Maintain Efficiently Stream Data in Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크에서 스트림 데이터를 효율적으로 관리하는 저장 관리자 구현)

  • Lee, Su-An;Kim, Jin-Ho;Shin, Sung-Hyun;Nam, Si-Byung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.24-33
    • /
    • 2009
  • Stream data, gathered from ubiquitous sensor networks, change continuously over time. Because they have quite different characteristics from traditional databases, we need new techniques for storing and querying/analyzing these stream data, which are research issues recently emerging. In this research, we implemented a storage manager gathering stream data and storing them into databases, which are sampled continuously from sensor networks. The storage manager cleans faulty data occurred in mobile sensors and it also reduces the size of stream data by merging repeatedly-sampled values into one and by employing the tilted time frame which stores stream data with several different sampling rates. In this research furthermore, we measured the performance of the storage manager in the context of a sensor network monitoring fires of a building. The experimental results reveal that the storage manager reduces significantly the size of storage spaces and it is effective to manage the data stream for real applications monitoring buildings and their fires.

An intelligent system for automatic data extraction in E-Commerce Applications

  • Cardenosa, Jesus;Iraola, Luis;Tovar, Edmundo
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.202-208
    • /
    • 2001
  • One of the most frequent uses of Internet is data gathering. Data can be about many themes but perhaps one of the most demanded fields is the tourist information. Normally, databases that support these systems are maintained manually. However, there is other approach, that is, to extract data automatically, for instance, from textual public information existing in the Web. This approach consists of extracting data from textual sources(public or not) and to serve them totally or partially to the user in the form that he/she wants. The obtained data can maintain automatically databases that support different systems as WAP mobile telephones, or commercial systems accessed by Natural Language Interfaces and others. This process has three main actors. The first is the information itself that is present in a particular context. The second is the information supplier (extracting data from the existing information) and the third is the user or information searcher. This added value chain reuse and give value to existing data even in the case that these data were not tough for the last use by the use of the described technology. The main advantage of this approach is that it makes independent the information source from the information user. This means that the original information belongs to a particular context, not necessarily the context of the user. This paper will describe the application based on this approach developed by the authors in the FLEX EXPRIT IV n$^{\circ}$EP29158 in the Work-package "Knowledge Extraction & Data mining"where the information captured from digital newspapers is extracted and reused in tourist information context.

  • PDF

Location Management System using CDMA Communications of Telematics Terminals (텔레매틱스 단말기의 CDMA 통신을 이용한 위치 관리 시스템)

  • Kim Jin-Deog;Choi Jin-Oh;Moon Sang-Ho;Lee Sang-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1843-1850
    • /
    • 2004
  • If the location information of a great number of cars kept for business with telematics terminals is acquired and managed efficiently, this information forms the foundation for controlling cars and traffic flows. The studies on the pure spatial indices have focused on the efficient retrievals. However, the acquisition and management of the terminal location of moving objects are more important than the efficiency of the query processing in the moving object databases. Therefore, it will be need to adopt parallel processing system for the moving object databases which should maintain the object's current location as precise as possible. This paper proposes a location management system using CDMA communications of telematics terminals. More precisely, we propose a architecture of spatial indexing mobile objects using multiple processors, and also newly propose a method of splitting buckets using the properties of moving objects in order to minimize the number of database updates. We also propose a acquisition method for gathering the location information of moving objects and passing the information of the bucket extents in order to reduce the amount of passed messages between processors.

Bulk Insertion Method for R-tree using Seeded Clustering (R-tree에서 Seeded 클러스터링을 이용한 다량 삽입)

  • 이태원;문봉기;이석호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.30-38
    • /
    • 2004
  • In many scientific and commercial applications such as Earth Observation System (EOSDIS) and mobile Phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To efficiently manage multidimensional data in scientific and data warehousing environments, R-tree based index structures have been widely used. In this paper, we propose a scalable technique called seeded clustering that allows us to maintain R-tree indexes by bulk insertion while keeping pace with high data arrival rates. Our approach uses a seed tree, which is copied from the top k levels of a target R-tree, to classify input data objects into clusters. We then build an R-tree for each of the clusters and insert the input R-trees into the target R-tree in bulk one at a time. We present detailed algorithms for the seeded clustering and bulk insertion as well as the results from our extensive experimental study. The experimental results show that the bulk insertion by seeded clustering outperforms the previously known methods in terms of insertion cost and the quality of target R-trees measured by their query performance.

An R-tree Index Scheduling Method for kNN Query Processing in Multiple Wireless Broadcast Channels (다중 무선 방송채널에서 kNN 질의 처리를 위한 R-tree 인덱스 스케줄링 기법)

  • Jung, Eui-Jun;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.37 no.2
    • /
    • pp.121-126
    • /
    • 2010
  • This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

Interdependent Data Allocation a Scheme over Multiple Wireless Broadcast Channels (다중 무선 방송채널에서 상호 관련 데이타 할당 방법)

  • Park, Sung-Wook;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.36 no.1
    • /
    • pp.30-43
    • /
    • 2009
  • Broadcast in the wireless environment has drawn much attention because it is capable of sending data to clients regardless of the number of clients. Most previous researches have aimed at obtaining an independent data item in a minimum time. But, they have not been researched on simultaneously receiving dependent data items in a query. In addition, these papers have only researched allocation problem that have not been came out data items in a query in same time and different channels. The access probability of each data item based on query request probability have not been reflected. This paper proposes a new method of allocating data items and simultaneously minimizing average response time required in receiving all the dependent data items in a query. Our performance analysis shows that our proposed method gives better average response time over the existing methods.

An Index Allocation Method for the Broadcast Data in Mobile Environments with Multiple Wireless Channels (멀티무선채널을 갖는 모바일 환경에서 브로드캐스트 데이타를 위한 인덱스 할당 방법)

  • 이병규;정성원;이승중
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.37-52
    • /
    • 2004
  • Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.