answersLogoWhite

0

Which data structures are indexed

Updated: 9/17/2019
User Avatar

Wiki User

12y ago

Best Answer

Arrays.

User Avatar

Wiki User

6y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Which data structures are indexed
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Advantages of indexed sequential file organisation?

ADVANTAGES of INDEXED FILES 1. Quite easy to process, 2. With proper selection of a key field, records in a large file can be searched and accessed in very quickly. 3. Any field of the records can be used as the key. The key field can be numerical or alphanumerical. DISADVANTAGES of INDEXED FILES 1. Extra data structures have to be maintained (the COBOL run-time modules take care of these and it is not the programmers' concern). These extra data structures maintained on the disk can use up much disk space, especially for long key values. 2. The indexed files have to be reorganized from time time to get rid of deleted records and improve performance that gets gradually decreased with addition of new records.


What are indexed data bases?

Indexed databases are databases that use an index data structure to efficiently retrieve and access data. The index stores keys and pointers to the actual data, allowing for faster search and retrieval of information. Indexes help in optimizing performance by reducing the number of disk accesses needed to locate specific data.


What is the fundamental difference between logical and physical data structures?

1) Logical data structures are structures that emphasize on data relationships and how data is related from the view of the user. 2) Physical data structures are data models that emphasize on the use of efficiently and effectively storing data in memory.


The need for complex data structures?

Explain the need for complex data structures


What is indexed addressing mode?

When stored in contiguous blocks, data usually has a base address. Accessing any data from the block requires an offset to the base address which is achieved through an index. The adding of an offset to the base address is called indexed addressing.


What is the linear data structures?

Linear data structures are 1-dimensional arrays, as in: vectors.


Primary data secondary data?

primary data structures


What are primary data and secoundary data?

primary data structures


What has the author Michael B Feldman written?

Michael B. Feldman has written: 'Data Structures With Ada' 'Data structures with Modula-2' -- subject(s): Data structures (Computer science), Modula-2 (Computer program language) 'Data structures with Ada' -- subject(s): Ada (Computer program language), Data structures (Computer science)


What is internal software data structures?

I think it is the objects(data structures) that are passed among the components of the software.


What is a indexed sequential file?

An indexed sequential file is a type of file organization where data records are stored sequentially in the order of key values. An index is maintained to help locate records quickly. This combination of sequential storage and indexing allows for efficient access to data in both sequential and random access patterns.


What types of index data structures can you have?

There are three types of index data structures: unique, non-unique, bitmap