• Title/Summary/Keyword: Uncertain database

Search Result 47, Processing Time 0.026 seconds

Semantics of Uncertain Databases based on Linear Logic (선형논리에 기반한 불확실성 데이터베이스 의미론)

  • Park, Sung-Woo
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.2
    • /
    • pp.148-154
    • /
    • 2010
  • In the study of the formal semantics of uncertain databases, we typically take an algebraic approach by mapping an uncertain database to possible worlds which are a set of relational databases. In this paper, we present a new semantics for uncertain databases which takes a logical approach by translating uncertain databases into logical theories. A characteristic feature of our semantics is that it uses linear logic, instead of propositional logic, as its logical foundation. Linear logic is suitable for a logical interpretation of uncertain information because unlike propositional logic, it treats logical formulae not as persistent facts but as consumable resources. As the main result, we show that our semantics is faithful to the operational account of uncertain databases in the algebraic approach.

Data Mining for Uncertain Data Based on Difference Degree of Concept Lattice

  • Qian Wang;Shi Dong;Hamad Naeem
    • Journal of Information Processing Systems
    • /
    • v.20 no.3
    • /
    • pp.317-327
    • /
    • 2024
  • Along with the rapid development of the database technology, as well as the widespread application of the database management systems are more and more large. Now the data mining technology has already been applied in scientific research, financial investment, market marketing, insurance and medical health and so on, and obtains widespread application. We discuss data mining technology and analyze the questions of it. Therefore, the research in a new data mining method has important significance. Some literatures did not consider the differences between attributes, leading to redundancy when constructing concept lattices. The paper proposes a new method of uncertain data mining based on the concept lattice of connotation difference degree (c_diff). The method defines the two rules. The construction of a concept lattice can be accelerated by excluding attributes with poor discriminative power from the process. There is also a new technique of calculating c_diff, which does not scan the full database on each layer, therefore reducing the number of database scans. The experimental outcomes present that the proposed method can save considerable time and improve the accuracy of the data mining compared with U-Apriori algorithm.

Implementation issues for Uncertain Relational Databases

  • Yu, Hairong;Ramer, Arthur
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.128-133
    • /
    • 1998
  • This paper aims to present some ideas for implementation of Uncertain Relational Databases (URD) which are extensions of classical relational databases. Our system firstly is based on possibility distribution and probability theory to represent and manipulate fuzzy and probabilistic information, secondly adopts flexible mechanisms that allow the management of uncertain data through the resources provided by both available relational database management systems and front-end interfaces, and lastly chooses dynamic SQL to enhance versatility and adjustability of systems.

  • PDF

PROJECTION OF TRAJECTORY FOR SUPPORTING UNCERTAINTY FUTURE TIME OF MOVING OBJECT

  • Won Ho-Gyeong;Jung Young Jin;Lee Yang Koo;Park Mi;Kim Hak-cheol;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.72-75
    • /
    • 2005
  • Uncertainty of objects in Moving Object Database is a coherent property. It has been discussed in a lot of researches on modelling and query processing. The previous studies assume that uncertain future time is determined through utilizing recent speed and direction of vehicles. This method is simple and useful for estimating the time of the near future location. However, it is not appropriate when we estimate the time of the far future location. Therefore, in this paper, we propose a concept of planned route. It is used to estimate uncertain future time, which has to be located at a given point. If the route of an object is planned beforehand its locations are uncertainly distributed near that route. By a simple projection operation, the probability that a location lies in the planned route is increased. Moreover, we identify the future time of an object based on the speed for passing the route, which is offered via a website.

  • PDF

An extended Access Control with Uncertain Context

  • Kang, Woojun
    • International journal of advanced smart convergence
    • /
    • v.7 no.4
    • /
    • pp.66-74
    • /
    • 2018
  • While new information technology advances have made information access and acquisition methods much more diverse and easier, there are side effects that allow illegal access using diverse and high-performance tools. In order to cope with such threats, there are access control methods in database technology, and various studies are being conducted to extend traditional access control to cope with new computing environments. In this paper, we propose an extended access control with uncertain context-awareness. It enables appropriate security policy enforcement even if the contextual constraints specified by the security policy does not match those accompanied by access request query. We extract semantic implications from context tree, and define the argument that can quantitatively measure the semantic difference between two nodes in the context tree. It is used to semantically enforce the security policy, and to prevent the excessive authorization caused by the implication.

A Fuzzy Spatiotemporal Data Model and Dynamic Query Operations

  • Nhan, Vu Thi Hong;Kim, Sang-Ho;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.564-566
    • /
    • 2003
  • There are no immutable phenomena in reality. A lot of applications are dealing with data characterized by spatial and temporal and/or uncertain features. Currently, there has no any data model accommodating enough those three elements of spatial objects to directly use in application systems. For such reasons, we introduce a fuzzy spatio -temporal data model (FSTDM) and a method of integrating temporal and fuzzy spatial operators in a unified manner to create fuzzy spatio -temporal (FST) operators. With these operators, complex query expression will become concise. Our research is feasible to apply to the management systems and query processor of natural resource data, weather information, graphic information, and so on.

  • PDF

Establishment of Change Order Database for Reducing Change Order in Construction Phase

  • Shin, Hyun-Kyung;Cha, Yongwon;Han, Sangwon;Hyun, Chang-Taek
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.622-624
    • /
    • 2015
  • As uncertain factors are latent in a construction project by nature, a change order occurs frequently. The occurrence of change orders in construction projects conducted during construction phase is known to cause unexpected negative impacts such as cost overrun, schedule delay, quality problem, and claims in the post-process. Thus, an efficient management method is necessary to prevent and minimize change orders during construction phase when they occur frequently. This paper analyzed the causes of change orders and the impact factors that occur during the construction phase of a construction project and suggested a direction for change order database building.

  • PDF

Estimation of Uncertain Past and Future Locations of Moving objects (이동 객체의 불확실한 과거 및 미래의 위치 추정)

  • 안윤애;류근호
    • Journal of KIISE:Databases
    • /
    • v.29 no.6
    • /
    • pp.441-452
    • /
    • 2002
  • If continuous moving objects are managed by conventional database, it is not possible for them to store all position information changed over time in the database. Therefore, a time period of regular rate is determined and position information of moving objects are discretely stored in the system for every time period. However, if continuous moving objects are managed as discrete model, we will have problems which cannot properly answer to the query about uncertain past or future position information. To solve this problem, in this paper, we propose the method and algorithm which use the history information stored in the same database, to estimate the past or future location of moving objects. The cubic spline interpolation is used to estimate the past location and the mean movement value of the history information is used to predict the future location of moving objects. Finally, from the location estimation experimentation of using virtual trajectory and location sample, we proved that the proposed cubic spline function has less error than the linear function.

Uncertainty Region Scheme for Query Processing of Uncertain Moving Objects (불확실 이동체의 질의 처리를 위한 불확실성 영역 기법)

  • Ban Chae-Hoon;Hong Bong-Hee;Kim Dong-Hyun
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.261-270
    • /
    • 2006
  • Positional data of moving objects can be regularly sampled in order to minimize the cost of data collection in LBS. Since position data which are regularly sampled cannot include the changes of position occurred between sampling periods, sampled position data differ from the data predicted by a time parameterized linear function. Uncertain position data caused by these differences make the accuracy of the range queries for present positions diminish in the TPR tree. In this paper, we propose the uncertainty region to handle the range queries for uncertain position data. The uncertainty region is defined by the position data predicted by the time parameterized linear function and the estimated uncertainty error. We also present the weighted recent uncertainty error policy and the kalman filter policy to estimate the uncertainty error. For performance test, the query processor based by the uncertainty region is implemented in the TPR tree. The experiments show that the Proposed query processing methods are more accurate than the existing method by 15%.

Design of A Moving Object Management System for Tracking Vehicle Location (차량 위치 추적을 위한 이동 객체 관리 시스템의 설계)

  • Ahn, Yoon-Ae;Kim, Dong-Ho;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.827-836
    • /
    • 2002
  • Moving object management systems manage spatiotemporal data, which change their location over tine such as people, animals, and cars. These moving object management systems can be applied to vehicle location tracking, digital battlefield, location-based service, and so on. The existing moving object management systems only manage past or future location of the moving objects separately. Therefore, they cannot suggest estimation method of uncertain past or future location of the moving objects. In this paper, we propose a moving object management system, which not only manages historical data of the moving objects, but also predicts past and future location of the moving objects using historical data stored in database. We define the moving objects for vehicle location tracking and propose a moving object database structure. Finally, we suggest an execution model of the proposed system and apply the execution model to a virtual scenario for vehicle tracking.