Matches in SemOpenAlex for { <https://semopenalex.org/work/W1567176026> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W1567176026 abstract "Large read-only or read-write transactions with a large read set and a small write set constitute an important class of transactions used in such applications as data mining, data warehousing, statistical applications, and report generators. Such transactions are best supported with optimistic concurrency, because locking of large amounts of data for extended periods of time is not an acceptable solution. The abort rate in regular optimistic concurrency algorithms increases exponentially with the size of the transaction. The algorithm proposed in this dissertation solves this problem by using a new transaction scheduling technique that allows a large transaction to commit safely with significantly greater probability that can exceed several orders of magnitude versus regular optimistic concurrency algorithms. A performance simulation study and a formal proof of serializability and external consistency of the proposed algorithm are also presented.This dissertation also proposes a new query optimization technique (lazy queries). Lazy Queries is an adaptive query execution scheme which optimizes itself as the query runs. Lazy queries can be used to find an intersection of sub-queries in a very efficient way, which does not require full execution of large sub-queries nor does it require any statistical knowledge about the data.An efficient optimistic concurrency control algorithm used in a massively parallel B-tree with variable-length keys is introduced. B-trees with variable-length keys can be effectively used in a variety of database types. In particular, we show how such a B-tree was used in our implementation of a semantic object-oriented DBMS. The concurrency control algorithm uses semantically safe optimistic virtual locks that achieve very fine granularity in conflict detection. This algorithm ensures serializability and external consistency by using logical clocks and backward validation of transactional queries. A formal proof of correctness of the proposed algorithm is also presented." @default.
- W1567176026 created "2016-06-24" @default.
- W1567176026 creator A5079101779 @default.
- W1567176026 creator A5087876460 @default.
- W1567176026 date "1998-01-01" @default.
- W1567176026 modified "2023-09-24" @default.
- W1567176026 title "Algorithms for efficient transaction management and consistent queries in client-server semantic object-oriented parallel databases" @default.
- W1567176026 hasPublicationYear "1998" @default.
- W1567176026 type Work @default.
- W1567176026 sameAs 1567176026 @default.
- W1567176026 citedByCount "2" @default.
- W1567176026 countsByYear W15671760262017 @default.
- W1567176026 crossrefType "journal-article" @default.
- W1567176026 hasAuthorship W1567176026A5079101779 @default.
- W1567176026 hasAuthorship W1567176026A5087876460 @default.
- W1567176026 hasConcept C157692150 @default.
- W1567176026 hasConcept C173608175 @default.
- W1567176026 hasConcept C191558696 @default.
- W1567176026 hasConcept C25185021 @default.
- W1567176026 hasConcept C41008148 @default.
- W1567176026 hasConcept C72108876 @default.
- W1567176026 hasConcept C75949130 @default.
- W1567176026 hasConcept C77088390 @default.
- W1567176026 hasConcept C80444323 @default.
- W1567176026 hasConceptScore W1567176026C157692150 @default.
- W1567176026 hasConceptScore W1567176026C173608175 @default.
- W1567176026 hasConceptScore W1567176026C191558696 @default.
- W1567176026 hasConceptScore W1567176026C25185021 @default.
- W1567176026 hasConceptScore W1567176026C41008148 @default.
- W1567176026 hasConceptScore W1567176026C72108876 @default.
- W1567176026 hasConceptScore W1567176026C75949130 @default.
- W1567176026 hasConceptScore W1567176026C77088390 @default.
- W1567176026 hasConceptScore W1567176026C80444323 @default.
- W1567176026 hasLocation W15671760261 @default.
- W1567176026 hasOpenAccess W1567176026 @default.
- W1567176026 hasPrimaryLocation W15671760261 @default.
- W1567176026 hasRelatedWork W139502952 @default.
- W1567176026 hasRelatedWork W1518897596 @default.
- W1567176026 hasRelatedWork W1547416953 @default.
- W1567176026 hasRelatedWork W1553936647 @default.
- W1567176026 hasRelatedWork W1838939192 @default.
- W1567176026 hasRelatedWork W1968574285 @default.
- W1567176026 hasRelatedWork W1975814632 @default.
- W1567176026 hasRelatedWork W1996303060 @default.
- W1567176026 hasRelatedWork W2017557535 @default.
- W1567176026 hasRelatedWork W2079537925 @default.
- W1567176026 hasRelatedWork W2174331520 @default.
- W1567176026 hasRelatedWork W2210874231 @default.
- W1567176026 hasRelatedWork W2229993091 @default.
- W1567176026 hasRelatedWork W2347108575 @default.
- W1567176026 hasRelatedWork W2425887948 @default.
- W1567176026 hasRelatedWork W2912051829 @default.
- W1567176026 hasRelatedWork W87790095 @default.
- W1567176026 hasRelatedWork W2146967341 @default.
- W1567176026 hasRelatedWork W2186238354 @default.
- W1567176026 hasRelatedWork W2343446703 @default.
- W1567176026 isParatext "false" @default.
- W1567176026 isRetracted "false" @default.
- W1567176026 magId "1567176026" @default.
- W1567176026 workType "article" @default.