Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Uncertainty in a nested relational database model
Date
1999-07-01
Author
Yazıcı, Adnan
Buckles, BP
Petry, FE
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
204
views
0
downloads
Cite This
Some database models have already been developed to deal with complex values but they have constrains that data stored is precise and queries are crisp. However, as many researchers have pointed out, there is a need to present, manipulate, and query complex and uncertain data of various non-traditional database applications such as oceanography, multimedia, meteorology, office automation systems, engineering designs, expert database systems and geographic information systems. In this paper, we present a logical database model, which is an extension of a nested relational data model (also known as an NF2 data model), for representing and manipulating complex and uncertain data in databases. We also introduce a possible physical representation of such complex and uncertain values in databases and describe the query processing of the model that we discuss here.
Subject Keywords
Complex values
,
Physical representation
,
Query processing
,
Extended NF2 data model
,
Uncertainty
URI
https://hdl.handle.net/11511/62867
Journal
DATA & KNOWLEDGE ENGINEERING
DOI
https://doi.org/10.1016/s0169-023x(99)00010-5
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Confidence-based concept discovery in multi-relational data mining
Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (2008-03-21)
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, a new ILP-based concept dis...
Concurrency control for distributed multiversion databases through time intervals
Halıcı, Uğur (1991-04-01)
© 1991 ACM.Multiversion Schedulers are now a widely accepted method for enhancing performance of the concurrency control component of a database. When the read and write sets of transactions are known in advance, the amount of concurrency provided by the Multiversion Schedulers can further be improved. In this paper, a new concurrency control technique, which uses multiversion data in conjunction with predeclared read-write sets and the Time Interval technique is suggested. With the proposed method, a trans...
Short-tailed distributions and inliers
Akkaya, Ayşen (Springer Science and Business Media LLC, 2008-08-01)
We consider two families of short-tailed distributions (kurtosis less than 3) and discuss their usefulness in modeling numerous real life data sets. We develop estimation and hypothesis testing procedures which are efficient and robust to short-tailed distributions and inliers.
Distributed database design with integer linear programming and evolutionary hybrid algorithms
Tosun, Umut; Coşar, Ahmet; Department of Computer Engineering (2013)
The communication costs of remote access and retrieval of table fragments required in the execution of distributed database queries, are the major factors determining the quality of a distributed database design. Data allocation algorithms try to minimize these costs by dividing database tables into horizontal fragments, then assigning each fragment at or near the database sites they are needed more frequently. In this thesis, we propose efficient optimization algorithms for centralized and distributed data...
Improving the performance of Hadoop/Hive by sharing scan and computation tasks
Özal, Serkan; Toroslu, İsmail Hakkı; Doğaç, Asuman; Department of Computer Engineering (2013)
MapReduce is a popular model of executing time-consuming analytical queries as a batch of tasks on large scale data. During simultaneous execution of multiple queries, many oppor- tunities can arise for sharing scan and/or computation tasks. Executing common tasks only once can reduce the total execution time of all queries remarkably. Therefore, we propose to use Multiple Query Optimization (MQO) techniques to improve the overall performance of Hadoop Hive, an open source SQL-based distributed warehouse sy...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Yazıcı, B. Buckles, and F. Petry, “Uncertainty in a nested relational database model,”
DATA & KNOWLEDGE ENGINEERING
, pp. 275–301, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62867.