• Title/Summary/Keyword: Relational Data Model

Search Result 336, Processing Time 0.028 seconds

Design of the complex Object Algebra for Enhancing Expressive Power (표현력 증대를 위한 복합 객체 대수의 설계)

  • Song, Ji-Yeong;Bae, Hae-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1355-1364
    • /
    • 1996
  • A complex object model is one of the value based data model which extends the existing relational data model for supporting complex structured data. This paper studies a method for designing algebra for the complex object model. For this some others' algebra supporting complex objects are compared and analysed in terms of the applicability of a algebraic optimization strategics. The complex object algebra is designed, based on four principles, simple and clear definitions, no restriction on input data, single specification system. The central nature of this paper is to keep the basis of algebraic optimization method through simplicity, safety and the applicability of algebraic optimization strategy. Finally, it shown that the designed algebra has the equivalent or enhanced expressability with other's algebra.

  • PDF

A Study on Effective Real Estate Big Data Management Method Using Graph Database Model (그래프 데이터베이스 모델을 이용한 효율적인 부동산 빅데이터 관리 방안에 관한 연구)

  • Ju-Young, KIM;Hyun-Jung, KIM;Ki-Yun, YU
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.25 no.4
    • /
    • pp.163-180
    • /
    • 2022
  • Real estate data can be big data. Because the amount of real estate data is growing rapidly and real estate data interacts with various fields such as the economy, law, and crowd psychology, yet is structured with complex data layers. The existing Relational Database tends to show difficulty in handling various relationships for managing real estate big data, because it has a fixed schema and is only vertically extendable. In order to improve such limitations, this study constructs the real estate data in a Graph Database and verifies its usefulness. For the research method, we modeled various real estate data on MySQL, one of the most widely used Relational Databases, and Neo4j, one of the most widely used Graph Databases. Then, we collected real estate questions used in real life and selected 9 different questions to compare the query times on each Database. As a result, Neo4j showed constant performance even in queries with multiple JOIN statements with inferences to various relationships, whereas MySQL showed a rapid increase in its performance. According to this result, we have found out that a Graph Database such as Neo4j is more efficient for real estate big data with various relationships. We expect to use the real estate Graph Database in predicting real estate price factors and inquiring AI speakers for real estate.

Spatial Object-Relational Data Model in iSTORM (iSTORM에서의 공간 객체-관계 데이터 모델)

  • 박경현;남광우;박성희;류근호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.24-26
    • /
    • 2000
  • 공간 데이터는 복합적인 속성들의 조합으로 이루어지며 연산 또한 복합적이라는 점에서 일반 데이터와 다른 특성을 갖는다. 따라서 공간 데이터는 일반 속성 데이터와 구별되는 파일이나 별도의 저장 구조를 사용하여 관리되어야 한다. 이것은 비공간 데이터와 공간 데이터간의 상호 동기화 문제와 트랜잭션의 처리 등에서 많은 문제점을 발생시키며 이를 해결하기 위해서는 공간 데이터와 비공간 데이터를 단일 데이터베이스화하여야 한다. 이 논문에서는 이러한 단일화된 데이터베이스 시스템을 지원하기 이한 공간 객체-관계 데이터 모델을 정의하고 이 모델을 구현하기 위한 타입 저장 방법들에 대해 기술한다.

  • PDF

Development of the design methodology for large-scale database based on MongoDB

  • Lee, Jun-Ho;Joo, Kyung-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.11
    • /
    • pp.57-63
    • /
    • 2017
  • The recent sudden increase of big data has characteristics such as continuous generation of data, large amount, and unstructured format. The existing relational database technologies are inadequate to handle such big data due to the limited processing speed and the significant storage expansion cost. Thus, big data processing technologies, which are normally based on distributed file systems, distributed database management, and parallel processing technologies, have arisen as a core technology to implement big data repositories. In this paper, we propose a design methodology for large-scale database based on MongoDB by extending the information engineering methodology based on E-R data model.

Construction of Street Trees Information Management Program Using GIS and Database (GIS와 데이터베이스를 이용한 가로수정보 관리프로그램 구축)

  • Kim, Hee-Nyeon;Jung, Sung-Gwan;Park, Kyung-Hun;You, Ju-Han
    • Current Research on Agriculture and Life Sciences
    • /
    • v.26
    • /
    • pp.45-54
    • /
    • 2008
  • The purpose of this research is to develope street trees management program for more an effective street trees management. The principal point of this program is to relate spatial data and attribute data that is the main concept in GIS(Geographic Information System). To do this function, MapObjects which is ESRI's mapping and GIS components was used to process spatial data and Access which had been developed by MS was used to manipulate attribute data in this program. Visual Basic also was used to design and develop user interfaces and procedures, relate two sort of data, and lastly complete Application. Relational data model was adopted to design tables and their relation, Antenucci's GIS development model was selected to design and complete this program. The configuration of this application is composed of management data and reference data. The management data includes the location of street tree, a growth condition, a surrounding environment, the characters of tree, an equipments, a management records and etc. The reference data include general information about tree, blight and insects.

  • PDF

Hypertext Model Extension and Dynamic Server Allocation for Database Gateway in Web Database Systems (웹 데이타베이스에서 하이퍼텍스트 모델 확장 및 데이타베이스 게이트웨이의 동적 서버 할당)

  • Shin, Pan-Seop;Kim, Sung-Wan;Lim, Hae-Chull
    • 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.

  • PDF

A Comparative Study of Estimation by Analogy using Data Mining Techniques

  • Nagpal, Geeta;Uddin, Moin;Kaur, Arvinder
    • Journal of Information Processing Systems
    • /
    • v.8 no.4
    • /
    • pp.621-652
    • /
    • 2012
  • Software Estimations provide an inclusive set of directives for software project developers, project managers, and the management in order to produce more realistic estimates based on deficient, uncertain, and noisy data. A range of estimation models are being explored in the industry, as well as in academia, for research purposes but choosing the best model is quite intricate. Estimation by Analogy (EbA) is a form of case based reasoning, which uses fuzzy logic, grey system theory or machine-learning techniques, etc. for optimization. This research compares the estimation accuracy of some conventional data mining models with a hybrid model. Different data mining models are under consideration, including linear regression models like the ordinary least square and ridge regression, and nonlinear models like neural networks, support vector machines, and multivariate adaptive regression splines, etc. A precise and comprehensible predictive model based on the integration of GRA and regression has been introduced and compared. Empirical results have shown that regression when used with GRA gives outstanding results; indicating that the methodology has great potential and can be used as a candidate approach for software effort estimation.

A Synchronization Technique of Mobile XML Documents using the Message Digest Tables (메시지다이제스트 테이블 기반의 모바일 XML 문서 동기화 기법)

  • Park, Seong-Jin
    • Journal of Information Technology Services
    • /
    • v.8 no.2
    • /
    • pp.157-171
    • /
    • 2009
  • In mobile XML environments, the efficient synchronization technique is required to maintain the consistency of replicated XML data because the same data can be replicated between so many different XML documents. In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client XML documents and a server XML database in mobile XML environments. The proposed an XML data synchronization technique(XSA) has the advantage of model generality aspect and storage space aspect by using the tuple-based message digest table to detect the data conflicts. The proposed technique can be applicable to the application requiring the consistency of replicated XML data without any restrictions in the heterogeneous(between hierarchical XML documents and relational XML databases) mobile environments.

Network Operation Support System on Graph Database (그래프데이터베이스 기반 통신망 운영관리 방안)

  • Jung, Sung Jae;Choi, Mi Young;Lee, Hwasik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.22-24
    • /
    • 2022
  • Recently, Graph Database (GDB) is being used in wide range of industrial fields. GDB is a database system which adopts graph structure for storing the information. GDB handles the information in the form of a graph which consists of vertices and edges. In contrast to the relational database system which requires pre-defined table schema, GDB doesn't need a pre-defined structure for storing data, allowing a very flexible way of thinking about and using the data. With GDB, we can handle a large volume of heavily interconnected data. A network service provider provides its services based on the heavily interconnected communication network facilities. In many cases, their information is hosted in relational database, where it is not easy to process a query that requires recursive graph traversal operation. In this study, we suggest a way to store an example set of interconnected network facilities in GDB, then show how to graph-query them efficiently.

  • PDF

XML Repository Model based on the Edge-Labeled Graph (Edge-Labeled Graph를 적용한 XML 저장 모델)

  • 김정희;곽호영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.993-1001
    • /
    • 2003
  • A RDB Storage Model based on the Edge-Labeled Graph is suggested for store the XML instance in Relational Databases(RDB). The XML instance being stored is represented by Data Graph based on the Edge-Labeled Graph. Data Path Table, Element, Attribute, and Table Index Table values are extracted. Then Database Schema is defined, and the extracted values are stored using the Mapper. In order to support querry, Repository Model offers the translator translating XQL which is used as query language under XPATH, into SQL. In addition, it creates DBtoXML generator restoring the stored XML instance. As a result, storage relationship between the XML instance and proposed model structure can be expressed in terms of Graph-based Path, and it shows the possibility of easy search of random Element and Attribute information.