J. D. Ullmann. Principles of database and knowledgebase systems. Principles of computer science series. Computer Science Press, Inc., Maryland, USA, 1988.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An O-Telos provider peer for the RDF-based Edutella.. - Wolpers, Nejdl, Brunkhorst (2002) (Correct)
....O Telos representation is realized. 3 The peer query service The chapter will provide some insight in how the data stored in an OTelos provider peer is regained using RDF queries. The RDF queries are posed to the peer by using the RDF QEL exchange language as described in [10] Based on Datalog [11] RDF QEL abstracts the various RDF storage layer query languages (e.g. SQL) and user level query languages (e.g. RDQL) thus providing the syntax and semantics for an overall standard query interface across heterogeneous peer repositories for any kind of RDF meta data. RDF QEL does not distinguish ....
J. D. Ullmann. Principles of database and knowledgebase systems. Principles of computer science series. Computer Science Press, Inc., Maryland, USA, 1988.
A Parallel Object-Oriented System for Realizing Reusable and.. - Lim (1993) (7 citations) (Correct)
....encourage modular structures in parallel programs, making it easier to port to different multiprocessors. Expressiveness of Parallel Constructs In the theoretical literature, certain common paradigms of parallel algorithms (e.g. divideand conquer [122, 72] pipeline [121] normal algorithms [221] and master worker [59] have been recognized in various works to parallelize sequential algorithms or develop new parallel algorithms. One finds that it is more straight forward to program algorithms in the above paradigms when certain kinds of language constructs are available. Examples of such ....
Jeffrey D. Ullman. Computational aspects of VLSI. Principles of computer science series. Computer Science Press, 1984.
Dependency Preserving Refinements and the Fundamental Problem .. - Makowsky, Ravve (1998) (2 citations) (Correct)
....finding a database scheme with certain desirable additional properties. Some of these properties addressed in the literature are Normal forms: 3NF, Boyce Codd NF, 4NF, 5NF, Domain Key NF are normal forms for individual relation schemes, ER Normal Form is a normal form for the database scheme, [Ull82, Mai83, MR92, Fag81]. All these normal forms are attempts to avoid insertion and deletion anomalies and to provide maximum data independence. They are related to the predominant role played by key dependencies. Given a set of dependencies Sigma let Sigma Key be the set of FD s which follow from Sigma and are keys ....
....Find deeper (model theoretic) criteria for separability and splitting. If a database schemes is specified by FD s only, it always splits. But if the database scheme originates from an ER scheme, the presence of inclusion dependencies will prevent, in general, splitting. The universal instance of [Ull82] is not necessarily a solution to the splitting problem, as the resulting translation scheme is not dependency preserving. Splitting is, in general, too strong a requirement. What we really want is that the interaction between the relations be as simple to express as possible. To capture this ....
J.D. Ullman. Principles of Database Systems. Principles of Computer Science Series. Computer Science Press, 2nd edition, 1982.
Translation Schemes and the Fundamental Problem of Database.. - Makowsky, Ravve (1996) (Correct)
....open whether the theory of Algebraic (Real) Closed Fields is connected. If a database schemes is specified by FD s only, it always splits. But if the database scheme originates from an ER scheme, the presence of inclusion dependencies will prevent, in general, splitting. The universal instance of [Ull82] is not necessarily a solution to the splitting problem, as the resulting translation scheme is not dependency preserving. Splitting is, in general, too strong a requirement. What we really want is that the interaction between the relations be as simple to express as possible. To capture this ....
J.D. Ullman. Principles of Database Systems. Principles of Computer Science Series. Computer Science Press, 2nd edition, 1982.
Using an O-Telos Peer to Provide Reasoning Capabilities .. - Wolpers, Brunkhorst.. (2002) Self-citation (Systems) (Correct)
....database 4 The Query and Reasoning Service This section provides some insight into the way the RDF(S) data imported into the O Telos Peer are queried, and how the reasoning facilities of ConceptBase are used for answering the RDF QEL queries [16] sent over the Edutella network. Based on Datalog [18] RDFQEL abstracts the various RDF storage layer query languages (e.g. SQL) and user level query languages thus providing the syntax and semantics for an overall standard query interface across heterogenous peer repositories for any kind of RDF meta data. RDF QEL does not distinguish between data ....
J. D. Ullmann. Principles of database and knowledgebase systems. Principles of computer science series. Computer Science Press, Inc., Maryland, USA, 1988.
The Ultrascalar Processor - An Asymptotically Scalable.. - Henry, Kuszmaul.. (1998) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI. Principles of Computer Science Series. Computer Science Press, 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC