EXPRESSIONS FOR COMPLETELY AND PARTLY UNSUCCESSFUL BATCHED SEARCH OF SEQUENTIAL AND TREE-STRUCTURED FILES

 
This item is provided by the institution :

Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA
see the original item page
in the repository's web site and access all digital files if the item*
share



Semantic enrichment by EKT
Journal part (EN)
Scientific article (EN)
1989 (EN)
EXPRESSIONS FOR COMPLETELY AND PARTLY UNSUCCESSFUL BATCHED SEARCH OF SEQUENTIAL AND TREE-STRUCTURED FILES (EN)
KOLLIAS, JG (EN)
MANOLOPOULOS, Y (EN)
A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in (EN)
journalArticle (EN)
Physical Database Design (EN)
Indexing Terms (EN)
Performance Evaluation (EN)
Engineering, Electrical & Electronic (EN)
Tree Structure (EN)
Computer Science, Software Engineering (EN)
National Technical University of Athens
Digital Library of National Technical University of Athens | Dspace@NTUA
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (EN)
English
1989 (EN)
http://hdl.handle.net/123456789/10005
794 (EN)
ISI:A1989U580800014 (EN)
15 (EN)
6 (EN)
799 (EN)
10.1109/32.24732 (EN)
0098-5589 (EN)
IEEE COMPUTER SOC (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)