answersLogoWhite

0

Data structures could be used to implement an efficient database. Linked lists for example will optimize insertion and deletion for ordered lists.

User Avatar

Sigrid Hill

Lvl 10
3y ago

What else can I help you with?

Related Questions

Applications of data structure?

no application


Concept of data independence?

Data independence is a form of database management that keeps data separated from all programs that make use of the data. As a cornerstone for the idea of a DBMS or database management system, data independence ensures that the data cannot be redefined or reorganized by any of the programs that make use of the data. In this manner, the dataremains accessible, but is also stable and cannot be corrupted by the applications using it.


Why is data independence lacking in file systems?

Data independence is lacking in file systems because they often store data in a format that is tightly coupled with the applications that use it. This means that changing the structure or format of the data requires modifications to the applications, leading to a lack of flexibility and interoperability. In contrast, databases offer better data independence by separating the physical storage of data from the logical representation, allowing for easier modifications without impacting applications.


What do you mean by data independence?

the ability to modify the structure or schema of one level without affecting the other level is call data independence it is of two type physical data independence logical data independence


What are the subject-matters of data structure?

types of data structure types of data structure


What is hierarchical structure in dbms?

In hierarchical database structure, data elements are linked together as an inverted tree structure. there's a root data element, below the root ,there are subordinate elements, each of which has its own subordinate elements and so on. It can have multiple levels. Data elements have parent-child relationship. A parent data element can have more than one subordinate elements, but a child can be connected with only one parent. Its limitation is it cannot provide flexibility in data access. because every data element can be accessed through a definite path from the root data element. All the relationships between data elements should map properly when tree structure is first designed.this database model is used in several database applications because data elements of several applications can be organized as a hierarchical tree structure.


How do you amend a data structure?

How do you amend a data structure?


How do digital dashboard and data mining applications differ from transaction processing applications?

Digital dashboard and data mining applications do not generate new data, but instead are used to summarize existing data to provide information to management


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is the weakness of Data structure diagram?

weakness of data structure diagrams


What is a homogeneous data structure and why is this a weakness for RDBMS?

in homogeneous data structure all the elements of same data types known as homogeneous data structure. example:- array


Which data structure used in database?

You create your own data structure in database.