Comments on batched searching of sequential and tree-structured files

Authors:
Marek Piwowarski
Affiliations:
Dept. of Complex Control Systems, Polish Academy of Sciences, Baltycka 5, 44-100 Gliwice, Poland
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1985

Citing 3
Cited 6

A unifying model of physical databases

ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files

ACM Transactions on Database Systems (TODS)
Analysis and performance of inverted data base structures

Communications of the ACM

File organizations & incrementally specified queries

SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files

IEEE Transactions on Software Engineering
A unified analysis of batched searching of sequential and tree-structured files

ACM Transactions on Database Systems (TODS)
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files

IEEE Transactions on Software Engineering
TBSAM: An Access Method for Efficient Processing of Statistical Queries

IEEE Transactions on Knowledge and Data Engineering
A study of modified interpolation search in compressed, fully transposed, ordered files

SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Exact formulas for the expected cost savings from batching requests against two types of j-ary trees are given. Approximate expressions are also presented.