FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W57442230> ?p ?o ?g. }

• W57442230 abstract "The B-tree data structure is the standard mechanism used to index direct access files. While reliability is a concern for the entire industry, no one had yet examined the effects on the B-tree structure when a system is abnormally terminated. Furthermore, while several variant B-tree structures have been proposed, they have not been fully explored in terms of their reliability in the face of system failure. This thesis addresses these two questions, and proposes a B'-tree structure which allows both the detection and the correction of damage caused by abnormal termination.The programs which update secondary stored B-trees are shown to contain critical paths. If a program crashes while executing within a critical path, the B-tree either loses indices or produces duplicated indices that are temporarily inaccessible. It is shown that there is no way to protect the standard B-tree structure from this kind of failure.A new B'-tree structure is proposed that allows error detection and recovery at negligible cost. The new structure differs from the standard B-tree by the inclusion of three additional fields: Median(x); Nephew(x); and Successor(x). The Nephew field is only used as a reference during error detection and is never traversed. The new B'-tree structure permits timely detection of crash damage and provides enough additional information to restart the update that caused the damage.The cost in storage and time complexity of the B'-tree protection scheme is shown to be negligible. The increase in storage for an order m B'-tree is 0(1/m) over its order m B-tree counterpart (practical values of m exceed 100). From the viewpoint of extra time, the protected update algorithms are essentially free, although there is a slightly increased overhead for key deletion. Neither error detection nor error recovery, however, increase the number of I/O operations beyond those that would normally occur.The B'-tree structure is potentially useful in large data bases and information retrieval systems. It may also serve as a partitioning mechanism for organizing k-d trees on secondary storage, and to protect them from crash. This partitioning also allows the application of heuristics that improve insertion efficiency, heretofore a major drawback to using the k-d tree. Since the k-d structure provides excellent lower performance bounds for range and nearest neighbor queries, their data base application would seem a profitable investigation." @default.
• W57442230 created "2016-06-24" @default.
• W57442230 creator A5078624578 @default.
• W57442230 date "1980-01-01" @default.
• W57442230 modified "2023-09-28" @default.
• W57442230 title "A crash tolerant b-tree data structure for database retrieval systems" @default.
• W57442230 hasPublicationYear "1980" @default.
• W57442230 type Work @default.
• W57442230 sameAs 57442230 @default.
• W57442230 citedByCount "1" @default.
• W57442230 crossrefType "journal-article" @default.
• W57442230 hasAuthorship W57442230A5078624578 @default.
• W57442230 hasConcept C113174947 @default.
• W57442230 hasConcept C11413529 @default.
• W57442230 hasConcept C114614502 @default.
• W57442230 hasConcept C121332964 @default.
• W57442230 hasConcept C124101348 @default.
• W57442230 hasConcept C134306372 @default.
• W57442230 hasConcept C162319229 @default.
• W57442230 hasConcept C163258240 @default.
• W57442230 hasConcept C163797641 @default.
• W57442230 hasConcept C199360897 @default.
• W57442230 hasConcept C33923547 @default.
• W57442230 hasConcept C41008148 @default.
• W57442230 hasConcept C43214815 @default.
• W57442230 hasConcept C62520636 @default.
• W57442230 hasConcept C75306776 @default.
• W57442230 hasConcept C78669399 @default.
• W57442230 hasConceptScore W57442230C113174947 @default.
• W57442230 hasConceptScore W57442230C11413529 @default.
• W57442230 hasConceptScore W57442230C114614502 @default.
• W57442230 hasConceptScore W57442230C121332964 @default.
• W57442230 hasConceptScore W57442230C124101348 @default.
• W57442230 hasConceptScore W57442230C134306372 @default.
• W57442230 hasConceptScore W57442230C162319229 @default.
• W57442230 hasConceptScore W57442230C163258240 @default.
• W57442230 hasConceptScore W57442230C163797641 @default.
• W57442230 hasConceptScore W57442230C199360897 @default.
• W57442230 hasConceptScore W57442230C33923547 @default.
• W57442230 hasConceptScore W57442230C41008148 @default.
• W57442230 hasConceptScore W57442230C43214815 @default.
• W57442230 hasConceptScore W57442230C62520636 @default.
• W57442230 hasConceptScore W57442230C75306776 @default.
• W57442230 hasConceptScore W57442230C78669399 @default.
• W57442230 hasLocation W574422301 @default.
• W57442230 hasOpenAccess W57442230 @default.
• W57442230 hasPrimaryLocation W574422301 @default.
• W57442230 hasRelatedWork W100318565 @default.
• W57442230 hasRelatedWork W1540916342 @default.
• W57442230 hasRelatedWork W1543525280 @default.
• W57442230 hasRelatedWork W1625053895 @default.
• W57442230 hasRelatedWork W1781705245 @default.
• W57442230 hasRelatedWork W1934042161 @default.
• W57442230 hasRelatedWork W2006131099 @default.
• W57442230 hasRelatedWork W2015463411 @default.
• W57442230 hasRelatedWork W2055701211 @default.
• W57442230 hasRelatedWork W2081290411 @default.
• W57442230 hasRelatedWork W2088519218 @default.
• W57442230 hasRelatedWork W2090733145 @default.
• W57442230 hasRelatedWork W2115878438 @default.
• W57442230 hasRelatedWork W2147147291 @default.
• W57442230 hasRelatedWork W2150988524 @default.
• W57442230 hasRelatedWork W2391197945 @default.
• W57442230 hasRelatedWork W2603194732 @default.
• W57442230 hasRelatedWork W2985381883 @default.
• W57442230 hasRelatedWork W2994216471 @default.
• W57442230 hasRelatedWork W3013112461 @default.
• W57442230 isParatext "false" @default.
• W57442230 isRetracted "false" @default.
• W57442230 magId "57442230" @default.
• W57442230 workType "article" @default.