• Spatial Information Research
• /
• v.19 no.2
• /
• pp.47-56
• /
• 2011

Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1557-1564
• /
• 1997

We propose an extension to Prolog called the count term for controlling Prolog execution. The purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog programs and for limiting the number of answers or proofs retrieved when Prolog is used as a database query language. Both syntax and operational semantics of the count term are defined. An implementation strategy based on WAM (Warren Abstract Machine) by modifying instructions related to backtracking behavior has been suggested.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.175-177
• /
• 2000

이기종 DB에 분산 저장되어 있는 데이터를 통합하여 사용자가 단일한 환경 내에서 각종 데이터를 접근, 관리할 수 있는 기술로써 멀티데이터베이TM 시스템(Multidatabase System:MDBS)이 연구되어 왔다. 그러나, 기존의 MDBS 는 사용하는 통합 모델에 따라 데이터 정의 언어나 데이터 처리 언어를 새로 정의하여 사용하였기 때문에, 지역 데이터베이스 시스템의 사용자는 새로운 데이터 모델과 데이터베이스 언어를 습득해야 하는 문제가 발생한다. 그러므로, 이를 해결하기 위해 현재 표준으로 진행되고 SQL3를 기반으로 한 MDBS의 개발이 요구된다. 본 논문에서는 SQL3를 확장한 멀티 데이터베이스 질의 언어(Multidatabase Query Language: MQL)를 제시하고 MQL을 이용한 3단계 스키마 통합 방안을 제안하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1829-1832
• /
• 2003

본 연구는 유의어 매트릭스를 이용하여 질의의 확장을 통한 컴포넌트 검색 과정을 기술하였다. 컴포넌트 검색은 질의를 입력하면 질의의 확장이 이루어지고 컴포넌트 사이의 신뢰도를 측정하여 검색한다. 신뢰도 계산을 위해서는 질의와 컴포넌트 사이에 유사한가를 나타내는 동치관계, 클래스의 가중치와 동치관계 값을 이용한 포함관계, 그리고 유사도를 계산한다. 끝으로 이들 값을 이용하여 신뢰도를 계산한 후 이 신뢰도 값에 의하여 유사 컴포넌트들을 검색하여 유사도 우선순위로 컴포넌트가 검색된다.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.617-619
• /
• 2003

GML(Geography Markup Language)은 XML(extensible Markup Language)의 장점을 이용하여 지리 데이터의 저장과 전송을 위해 OGC(Open GIS Consortium)에서 제안되었다 이러한 GML은 웹 환경의 발전에 따라 지리 정보 통합을 위해 널리 이용되고 있으나. GML 문서에 대한 지리 데이터 검색 기술은 미흡하다. 최근 W3C(World Wide Web Consortium)에서는 XML 문서로부터 데이터를 추출하기 위한 표준 질의어로 XQuery를 추천하기 위한 작업 초안(working draft) 상태에 있다. 그러나 이러한 XML 질의어는 지리 정보의 추출에 대한 고려는 하고 있지 않다. 따라서 본 논문에서는 지리 정보를 포함하고 있는 GML 문서를 기반으로 지리 정보를 검색. 추출할 수 있는 GML Query language인 GQuery를 제안하고자 한다. 본 논문의 GQuery는 서로 이질적인 공간 데이터베이스의 데이터를 통할하여. 통합된 문서내의 지리정보를 추출하기 위한 사용자 인터페이스로 이용할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.28 no.3
• /
• pp.272-284
• /
• 2001

웹 기반 검색 시스템에서사용자의 관심이 많은 문서를 선별하여 제공하기 위해 프로파일이나 시소러스에 관한 연구가 이루어지고 있다. 그러나, 프로파일이나 시소러스를 구축하고 유지보수 하는데 많은 시간과 노력이 필요하다. 특히 구축된 시소러스에 대해 구조화 및 적합성의 문제가 있다. 따라서, 이러한 문제점을 극복하고자 본 논문에서는 문서에서 추출한 용어 빈도를 문서에서 용어의 중요 정도로 사상시키기 위해 시그모이드 멤버 쉽 함수를 적용한다. 또한, 이 중요 정도에 따라 질의어를 확장하고 의미적으로 연결된 문서를 동일한 문서 집단으로 분류할 수 있는 알고리즘을 제안하여 사용자의 선호도가 반영된 문서를 선별하고 제공하고자 한다.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.5-12
• /
• 2004

The data transformation between XML and Relation Database is made through the Principle of mapping bewtween them. There are two ways to access SQL Server, one is to assign SQL query to URL and the other is to use template file. MS-SQL server takes advantage of OpenXML function to transform the results of executing SQL query into XML documents. That is, OpenXML first makes node tree and then transforms row set data of XML documents into XML data of relation type. In order to insert XML data into database data. data is extracted from parsing XML documents using sp_xml_preparedocument procedure, and then the document structure is mapped into tree structure and stored in a table of database. Consequently, Data transformation between XML and Relation Database is made through mapping bewtween them. This article proposes the principle of mapping between XML and Relation Database and then shows the implementation of transformation between them so that it introduces the possibilty of bringing the extension and efficiency of data and various effects.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.251-258
• /
• 1998

The purpose of this study is to develop the District-level Planning Support System (DPSS) by using GIS. The district-level planning which is related for district-level control of city, needs the various parcel-level information which is composing the urban physical environment. The information has to be stored and analyzed for recognizing the study area, then the district-level planning will be efficiently managed. The use of GIS in the process of district-level planning is restricted for the creation of thematic map. GIS is not used for the analysis of spatial patterns and planning process. This study evaluates the characteristics of current district-level planning and the basic components of urban physical environment. And the database model is built. The topology among components is defined by using the spatial relationship. Then the spatial query machine for district-level planing is developed by using ArcView 3.1, Avenue and Dialog Extension. This spatial query machine is applied for case study. This study shows 1) the possibility of the district-level planning support system for analyzing spatial relationship, 2) the needs of the up-to-date topographic map showing current building's footlines and the complete integration with cadastral maps, it will reduce the uncertainty in the spatial decision making process, 3) the methodology for the construction of spatial decision making rules, 4) the further study for the using of raster, network, image and three dimension data.