• Title/Summary/Keyword: Index Database

Search Result 866, Processing Time 0.028 seconds

Design and Implementation of a Main Memory Index based on the R-tree for Moving Object Databases (이동체 데이터베이스를 위한 R-tree 기반 메인 메모리 색인의 설계 및 구현)

  • Ahn, Sung-Woo;An, Kyoung-Hwan;Lee, Chaug-Woo;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.53-73
    • /
    • 2006
  • Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

  • PDF

The Scalability and the Strategy for EMR Database Encryption Techniques

  • Shin, David;Sahama, Tony;Kim, Steve Jung-Tae;Kim, Ji-Hong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.577-582
    • /
    • 2011
  • EMR(Electronic Medical Record) is an emerging technology that is highly-blended between non-IT and IT area. One of methodology to link non-IT and IT area is to construct databases. Nowadays, it supports before and after-treatment for patients and should satisfy all stakeholders such as practitioners, nurses, researchers, administrators and financial department and so on. In accordance with the database maintenance, DAS (Data as Service) model is one solution for outsourcing. However, there are some scalability and strategy issues when we need to plan to use DAS model properly. We constructed three kinds of databases such as plain-text, MS built-in encryption which is in-house model and custom AES (Advanced Encryption Standard) - DAS model scaling from 5K to 2560K records. To perform custom AES-DAS better, we also devised Bucket Index using Bloom Filter. The simulation showed the response times arithmetically increased in the beginning but after a certain threshold, exponentially increased in the end. In conclusion, if the database model is close to in-house model, then vendor technology is a good way to perform and get query response times in a consistent manner. If the model is DAS model, it is easy to outsource the database, however, some technique like Bucket Index enhances its utilization. To get faster query response times, designing database such as consideration of the field type is also important. This study suggests cloud computing would be a next DAS model to satisfy the scalability and the security issues.

EMI database analysis focusing on relationship between density and mechanical properties of sedimentary rocks

  • Burkhardt, Michael;Kim, Eunhye;Nelson, Priscilla P.
    • Geomechanics and Engineering
    • /
    • v.14 no.5
    • /
    • pp.491-498
    • /
    • 2018
  • The Earth Mechanics Institute (EMI) was established at the Colorado School of Mines (CSM) in 1974 to develop innovations in rock mechanics research and education. During the last four decades, extensive rock mechanics research has been conducted at the EMI. Results from uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), point load index (PLI), punch penetration (PP), and many other types of tests have been recorded in a database that has been unexamined for research purposes. The EMI database includes over 20,000 tests from over 1,000 different projects including mining and underground construction, and analysis of this database to identify relationships has been started with preliminary results reported here. Overall, statistically significant correlations are identified between bulk density and mechanical strength properties through UCS, BTS, PLI, and PP testing of sedimentary, igneous, and metamorphic rocks. In this paper, bulk density is considered as a surrogate metric that reflects both mineralogy and porosity. From this analysis, sedimentary rocks show the strongest correlation between the UCS and bulk density, whereas metamorphic rocks exhibit the strongest correlation between UCS and PP. Data trends in the EMI database also reveal a linear relationship between UCS and BTS tests. For the singular case of rock coral, the database permits correlations between bulk density of the core versus the deposition depth and porosity. The EMI database will continue under analysis, and will provide additional insightful and comprehensive understanding of the variation and predictability of rock mechanical strength properties and density. This knowledge will contribute significantly toward the increasingly safe and cost-effective geostructures and construction.

A New Method of Plaque Scoring and Database Implementation (치아 플라그 인덱스 도출 및 데이터베이스 구성)

  • Shin, Seung-Won;Kim, Kyeong-Seop;Lee, Sun-Ju;Kim, Dong-In;Kim, Kee-Deog;Park, Won-Se
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1200-1206
    • /
    • 2009
  • In this study, a new method of dental plaque scoring is proposed by adopting new criteria to divide the tooth surface with utilizing the geometrical features of a tooth color image. For the possible clinical usage of our new plaque scoring system, GUI(Graphic User Interface) system is also implemented to estimate the numerical plaque index for a specific tooth by designing the supplementary database management module that handles dental plaque scores.

Design and Implementation of an XML Document Management System Based on $O_2$ ($O_2$기반의 XML 문서관리 시스템 설계 및 구현)

  • 유재수
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.27-39
    • /
    • 2000
  • In this paper, we design and implement a XML management system based on OODBMS that supports structured information retrieval of XML documents. We also propose an object oriented modeling to store and fetch XML documents, to manage image data, and to support versioning for the XML document management system(XMS). The XMS consists of a repository manager that maintains the interfaces for external application programs, a XML instance storage manager that stores XML documents in the database, a XML instance manager that fetches XML documents stored in the database, a XML index manager that creates index for the structure information and the contents of documents, and a query processor that processes various queries.

  • PDF

Rend 3D R-tree: An Improved Index Structure in Moving Object Database Based on 3D R-tree (Rend 3D R-tree : 3D R-tree 기반의 이동 객체 데이터베이스 색인구조 연구)

  • Ren XiangChao;Kee-Wook Rim;Nam Ji Yeun;Lee KyungOh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.878-881
    • /
    • 2008
  • To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

The EBORD Benchmark for Database Systems (데이터베이스 시스템을 위한 EBORD 성능 평가 방법론)

  • Jeong, Hoe-Jin;Lee, Sang-Ho
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.2
    • /
    • pp.29-43
    • /
    • 2005
  • The paper presents the EBORD (Extended Benchmark for Object-Relational Databases) benchmark, which is an extension of the BORD benchmark for object-relational databases. The EBORD benchmark is developed to evaluate the database common functions that should be supported in modern database systems. Besides the 36 test queries already defined in the BORD benchmark, totally 22 test queries in five categories are newly defined in order to measure the index-relevant performance issues and database import capabilities. The EBORD benchmark also features scalability, use of a synthesized database, and a query-oriented evaluation. In order to show the feasibility of the proposed benchmark, we implement it with two commercial database systems. The experimental results and analyses are also reported.

  • PDF

A Study on Usability and Service Direction of Korean Science Citation Index (한국과학기술인용색인의 효용성 및 서비스 방향에 관한 연구)

  • 최광남;조현양;안세필
    • Journal of the Korean Society for information Management
    • /
    • v.19 no.4
    • /
    • pp.77-94
    • /
    • 2002
  • In this study we analyze the present situation of cited and citing references among researchers, based on Korean Science Citation Index developed by Korea Institute of Science & Technology Information. There are some differences on the rank of frequently cited journals between JCR of ISI and KSCI, especially in the field of mechanical engineering. The purpose of this study is to find an efficient way of constructing KSCI database and to propose a service model which can be available as a tool to evaluate research activities and to provide researcher with basic information resources.

An Efficient Compression Method for Multi-dimensional Index Structures (다차원 색인 구조를 위한 효율적인 압축 방법)

  • 조형주;정진완
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.429-437
    • /
    • 2003
  • Over the last decades, improvements in CPU speed have greatly exceeded those in memory and disk speeds by orders of magnitude and this enabled the use of compression techniques to reduce the database size as well as the query cost. Although compression techniques are employed in various database researches, there is little work on compressing multi-dimensional index structures. In this paper, we propose an efficient compression method called the hybrid encoding method (HEM) that is tailored to multi-dimensional indexing structures. The HEM compression significantly reduces the query cost and the size of multi-dimensional index structures. Through mathematical analyses and extensive experiments, we show that the HEM compression outperforms an existing method in terms of the index size and the query cost.