Which search method takes less memory?

Related MCQs

• An                           consists of a search-key value and pointers to one or more records with that value as their search-key value.
• In a                 clustering index, the index record contains the search-key value and a pointer to the first data record with that search- key value and the rest of the records will be in the sequential pointers.
• A search key containing more than one attribute is referred to as a                     search key.
• A search algorithm takes                     as an input and returns                  as an output.
• are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• In ordered indices the file containing the records is sequentially ordered, a                         is an index whose search key also defines the sequential order of the file.
• Indices whose search key specifies an order different from the sequential order of the file are called                        indices.
• appears for only some of the search-key values.
• TOPIC 4.2 SEARCH ENGINE ARCHITECTURES
• A problem in a search space is defined by one of these state.