Static Specification Analysis for Termination of Specification
... in the face of software errors. For example, the Lucent 5ESS switch and IBM MVS operating systems both use hand-coded audit and repair procedures to recover from these errors [16], [19]. The reported results indicate an order of magnitude increase in the reliability of these systems [12]. Similar re ...
... in the face of software errors. For example, the Lucent 5ESS switch and IBM MVS operating systems both use hand-coded audit and repair procedures to recover from these errors [16], [19]. The reported results indicate an order of magnitude increase in the reliability of these systems [12]. Similar re ...
Efficient External-Memory Data Structures and Applications
... advances are increasing CPU speeds at an annual rate of 40–60% while disk transfer rates are only increasing by 7–10% annually [113]. Internal memory sizes are also increasing, but not nearly fast enough to meet the needs of important large-scale applications. Modern operating systems try to minimiz ...
... advances are increasing CPU speeds at an annual rate of 40–60% while disk transfer rates are only increasing by 7–10% annually [113]. Internal memory sizes are also increasing, but not nearly fast enough to meet the needs of important large-scale applications. Modern operating systems try to minimiz ...
Relational DBMS Internals
... scientist and database application designers should have a good knowledge about both the theoretical and the engineering concepts that underline these systems to ensure the desired application performance. The book starts with an analysis of relational DBMS architecture and then presents the main st ...
... scientist and database application designers should have a good knowledge about both the theoretical and the engineering concepts that underline these systems to ensure the desired application performance. The book starts with an analysis of relational DBMS architecture and then presents the main st ...
Frequent Subtree Mining — An Overview
... , respectively. Luccio’s pre-order string for the rooted ordered tree in Figure 1(a) is . An advantage of Luccio’s pre-order string is that one can easily compute the pre-order string of any bottom-up subtree from the total pre-order string. For example, when we scan from label until we get an equal ...
... , respectively. Luccio’s pre-order string for the rooted ordered tree in Figure 1(a) is . An advantage of Luccio’s pre-order string is that one can easily compute the pre-order string of any bottom-up subtree from the total pre-order string. For example, when we scan from label until we get an equal ...
6. Lists
... • The new elements can be appended readily to the tail of the list. • Inserting an element into the middle of the list, however, requires shifting all following elements one place over in the array to make room for the new element. ...
... • The new elements can be appended readily to the tail of the list. • Inserting an element into the middle of the list, however, requires shifting all following elements one place over in the array to make room for the new element. ...
Storing and Indexing Massive RDF Data Sets
... 3. The third set of unclustered indexes consists of a combined index on property and object (po). 4. The final set has a combined clustered index on all columns together (spo). The authors note that, for an ad-hoc set of queries and on a specific RDF graph, the first set of indexes drastically impro ...
... 3. The third set of unclustered indexes consists of a combined index on property and object (po). 4. The final set has a combined clustered index on all columns together (spo). The authors note that, for an ad-hoc set of queries and on a specific RDF graph, the first set of indexes drastically impro ...
The following paper was originally published in the
... Micali [18] suggested the Certi cate Revocation system (CRS) in order to improve the CRL communication costs. The underlying idea is to sign a message for every certi cate stating whether it was revoked or not, and to use an o -line/on-line signature scheme [11] to reduce the cost of periodically up ...
... Micali [18] suggested the Certi cate Revocation system (CRS) in order to improve the CRL communication costs. The underlying idea is to sign a message for every certi cate stating whether it was revoked or not, and to use an o -line/on-line signature scheme [11] to reduce the cost of periodically up ...
Unimodal Regression via Prefix Isotonic
... ordering, and isotonic regression is often called monotonic regression, though in some application areas this term means the values decrease. Isotonic regression does not yield a smooth curve, but rather a collection of level sets where the regression is constant. Figure 1 gives an example of an iso ...
... ordering, and isotonic regression is often called monotonic regression, though in some application areas this term means the values decrease. Isotonic regression does not yield a smooth curve, but rather a collection of level sets where the regression is constant. Figure 1 gives an example of an iso ...
TOPICS IN ALGORITHMS
... leads to a new algorithm that use optimal linear space and has subquadratic running time or even faster when the number of leaves in one of the trees is small. The running time of our tree inclusion algorithm depends on the tree color problem, which we also used in our data structure for the binary ...
... leads to a new algorithm that use optimal linear space and has subquadratic running time or even faster when the number of leaves in one of the trees is small. The running time of our tree inclusion algorithm depends on the tree color problem, which we also used in our data structure for the binary ...
B-tree
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems.