Results 211 to 220 of about 36,093 (262)

Physical database design for relational databases

ACM Transactions on Database Systems, 1988
This paper describes the concepts used in the implementation of DBDSGN, an experimental physical design tool for relational databases developed at the IBM San Jose Research Laboratory. Given a workload for System R (consisting of a set of SQL statements and their execution frequencies), DBDSGN suggests physical configurations for efficient performance.
Sheldon J. Finkelstein, Mario Schkolnick, Paolo Tiberio   +2 more
openaire   +1 more source

Formal Concept Analysis in Relational Database and Rough Relational Database

Fundamenta Informaticae, 2007
Since its foundation in the early 1980's, Formal ConceptAnalysis (FCA) has been used in many applications in data analysis, information retrieval, and knowledge discovery. In this paper, we suggest to exploit the framework of relational database model (RDM) and rough relational database model (RRDM) for Formal Concept Analysis.
Feng Jiang, Yuefei Sui, Cungen Cao
openaire   +3 more sources

Composition of database relations

[1989] Proceedings. Fifth International Conference on Data Engineering, 2003
The authors argue for implementing composition as a primitive operation and present a single-sided composition algorithm that performs join protection and duplicate elimination as one unified operation. They report experimental results that show an operating region in which this algorithm outperforms composition by the standard method.
Rakesh Agrawal 0001, Shaul Dar, H. V. Jagadish   +2 more
openaire   +1 more source

ASDViews (relational databases)

Proceedings. 1988 IEEE Symposium on Security and Privacy, 2003
A description is given of ASDViews, an implementation of views as the security object in a multilevel secure relational database management system (DBMS) that results in a small trusted computing base (TCB) as required to meet the criteria for evaluation class B2 and above. A general view is the result of a database query.
Cristi Garvey, Amy Wu
openaire   +1 more source

Independence in Database Relations

2013
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y on database schemata. A relation satisfies X⊥Y if for every X-value and every Y-value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y-value.
Juha Kontinen, Sebastian Link, Jouko A. Väänänen   +2 more
openaire   +2 more sources

On Normalization of Relations in Relational Databases

Programming and Computer Software, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Relational Databases with Ordered Relations

Logic Journal of the IGPL, 2005
Summary: The paper deals with expressing preferences in the framework of the relational data model. Preferences have usually a form of a partial ordering. Therefore the question arises how to provide the relational data model with such an ordering.
openaire   +1 more source

Summarizing relational databases

Proceedings of the VLDB Endowment, 2009
Complex databases are challenging to explore and query by users unfamiliar with their schemas. Enterprise databases often have hundreds of inter-linked tables, so even when extensive documentation is available, new users must spend a considerable amount of time understanding the schema before they can retrieve any information from the database.
Yang, X., Procopiuc, C.M., Srivastava, D.   +2 more
openaire   +1 more source

Construction of relations in relational databases

ACM Transactions on Database Systems, 1980
Using a nonprocedural language for query formulation requires certain automatization of a query answering process. Given a query for creation of a new relation, the problem is to find an efficient procedure which produces this relation from a given relational database. We concentrate upon sequences of join operations which losslessly produce a relation
openaire   +1 more source

Fingerprinting relational databases

Proceedings of the 2006 ACM symposium on Applied computing, 2006
In this paper, we propose a fingerprinting solution to protect valuable numeric relational data from illegal duplications and redistributions. We introduce a twice-embedding scheme. In the first embedding process, we embed a unique fingerprint to identify each recipient to whom the relational data is distributed.
Fei Guo, Jianmin Wang 0001, Deyi Li
openaire   +1 more source