Page-queries as a tool for organizing secondary memory auxiliary databases. II. Optimal selection of SADB contents

Kamel, Nabil

doi:10.1016/0020-0255(93)90042-k

Cited by 2 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, this work is also related to work done on fragments of relations. The work in [9] makes use of some of these results by showing how they can be used to facilitate querying the SADB. Rosenkrantz and Hunt [13] give a digraph representation of a special class of predicates and give polynomial time algorithms for the satisfiability, equivalence and reduction problems when the ~ sign is not permitted.…”

Section: Related Workmentioning

confidence: 99%

“…Compacting page-query databases: The page-query concept was first introduced in [7] and further developed in [8] for artificial intelligence applications using large main memories, and in [9] for secondary memory auxiliary databases. The current paper extends this work further by showing how to compact auxiliary databases organized as collections of arbitrarily overlapping page-queries and in the presence of updates.…”

Section: Related Workmentioning

confidence: 99%

“…In [9], a performance model is presented based on which, closed formulae to assign those weights are also given. This weight reflects the amount of saving in page accesses per byte stored of the page-query in question.…”

Section: Assessing the Benefits Of Page-queriesmentioning

confidence: 99%

“…On termination, the selection process results in determining a number of page-queries which, when stored redundantly, will optimize performance during the next time period [9]. On termination, the selection process results in determining a number of page-queries which, when stored redundantly, will optimize performance during the next time period [9].…”

Section: Compacting the Sadbmentioning

confidence: 99%

See 3 more Smart Citations

Page-query compaction of secondary memory auxiliary databases

Kamel

1994

Distrib Parallel Databases

Self Cite

View full text Add to dashboard Cite

Prestoring redundant data in secondary memory auxiliary databases is an idea that can often yield improved retrieval performance through better clustering of related data. The clusters can be based on either whole query results or, as this paper indicates, on more specialized units called page-queries. The deliberate redundancy introduced by the designer is typically accompanied by much unnecessary redundancy among the elements of the auxiliary database. This paper presents algorithms for efficiently removing unwanted redundancy in auxiliary databases organized into page-query units. The algorithms presented here extend prior work done for secondary memory compaction in two respects: First, since it is generally not possible to remove all unwanted redundancies, the paper shows how can the compaction be done to remove the most undesirable redundancy from a system performance point-of-view. For example, among the factors considered in determining the worst redundancies are the update behavior and the effects of a particular compaction scheme on memory utilization. Second, unlike traditional approaches for database compaction which aim merely at reducing the storage space, this paper considers the paging characteristics in deciding on an optimal compaction scheme. This is done through the use of page-queries. Simulation results are presented and indicate that page-query compaction results in less storage requirements and more time savings than could be obtained by standard non-page-query compaction.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Assessing the Benefits Of Page-queriesmentioning

confidence: 99%

Section: Compacting the Sadbmentioning

confidence: 99%

See 2 more Smart Citations