A Comparative Study of Very Large Data Bases |
Other editions - View all
Common terms and phrases
100 percent full access storage device ADATA ANEXT ATAG ATAG(P available storage pool average number B-tree binary search tree bucket addresses bucket sizes called chaining with coalescing chaining with separate coalescing lists CODE CODE(P Comm_ACM comparison containing the address data structure Deletion Algorithm direct access storage disk address Edited ENEXT ETAG File Organization filial set function hash chaining INFO INFO[i internal main memory inverted file item name pointers key word key-to-address transformation h(K keys into bucket large data bases linear probing link variable linked list files list length load factor main memory addresses mean number node structure number of accesses number of items number of nodes number of probes number of records performance measures presented PUT not found requires fewer accesses Retrieval Algorithm root search algorithm Separate Lists Chaining STOP ENDDO Storage Space Requirements track containing transform the keys tree stored trie Zipf's law