Database method schemas: A model for object based and parallel database computation
Uloženo v:
| Vydáno v: | ProQuest Dissertations and Theses (1996) |
|---|---|
| Hlavní autor: | |
| Vydáno: |
ProQuest Dissertations & Theses
|
| Témata: | |
| On-line přístup: | Citation/Abstract Full Text - PDF |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 304229517 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798691278754 | ||
| 035 | |a 304229517 | ||
| 045 | 0 | |b d19960101 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Denninghoff, Karl Louis | |
| 245 | 1 | |a Database method schemas: A model for object based and parallel database computation | |
| 260 | |b ProQuest Dissertations & Theses |c 1996 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a A model capturing the data manipulation capabilities of a large class of deterministic methods in object-oriented databases is proposed and investigated. The model uses a parallel synchronous semantics with concurrent-read and concurrent-write. Many results focus on the expressive power of methods and help understand various constructs and semantics associated with methods. A language independent notion of expressive completeness is given that, unlike previous notions, admits both object creation and database updates. Database Method Schemas are shown to express essentially the same transformations as a powerful declarative database language $(Datalog\sbsp{\infty}{\neg*}).$ Moreover, the transformations expressible in Database Method Schemas and $Datalog\sbsp{\infty}{\neg*}$ are algebraically characterized by relating the automorphism groups of inputs and outputs. Restrictions of methods providing various tractability guarantees are also discussed. The restrictions correspond closely to well-known relational query languages such as relational calculus, Datalog, the fixpoint queries, and the while queries. Database Method Schemas is a model of database parallel computation which makes explicit the potential parallelism in databases. The impact of new language constructs on expressiveness with respect to object creation is investigated and constructs based on expanded notions of deep equality are introduced to increase expressive power. In particular, a tractable construct yielding a language complete with respect to object creation is given for the first time. The new construct is also relevant to query complexity; for example, it allows expressing in polynomial time some queries, like counting, requiring exponential space in Database Method Schemas alone. | |
| 653 | |a Computer science | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (1996) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/304229517/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/304229517/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |