Results 1-3 of 27
Figure 8-5 A file with a partial index Index • X Y would consist of finding the first
entry in the index that is equal to or greater than the desired entry and then
searching the corresponding sequential segment for the target record. For
example, to ...
In the terminology of popular hierarchical databases the nodes of the trees are
called segments, each of which is divided into parts called fields according to the
items of information held in the segment. We might observe that the database ...
Each of them will be accompanied by segment name and an optional WHERE
clause. For example, we use the syntax: GET-FIRST EMPLOYEE to retrieve the
information from the first root node in the database, or: GET-FIRST EMPLOYEE ...
What people are saying - Write a review
LibraryThing ReviewUser Review - readafew - LibraryThing
This book was assigned reading for the opening class to my MSIT. I found it a great refresher for a large part of my original CS degree. It is well put together and fairly easy to read. Lots of useful ... Read full review
LibraryThing ReviewUser Review - geekcowboy - LibraryThing
Great book to introduce the theory and practical concepts of computer science. Read full review
PART ONE Machine Architecture
11 other sections not shown