Comments on: 5 kinds of data structure and 16 kinds of data access method http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/ Choices in data management and analysis Mon, 25 Jan 2010 14:39:21 -0500 http://wordpress.org/?v=2.8.4 hourly 1 By: rena http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/comment-page-1/#comment-125535 rena Tue, 16 Jun 2009 08:53:44 +0000 http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/#comment-125535 may i know if what is the example of defferent kinds of data structure. may i know if what is the example of defferent kinds of data structure.

]]> By: Complete Rewrite http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/comment-page-1/#comment-100852 Complete Rewrite Thu, 30 Oct 2008 16:32:42 +0000 http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/#comment-100852 <strong>Models and Efficiency, part 2: Databases...</strong> There are endless possibilities for data structures and access methods. The implementers of early database systems, such as System R, chose to use a simple one-to-one mapping between the model and the physical storage. It was a natural choice as a fi..... Models and Efficiency, part 2: Databases…

There are endless possibilities for data structures and access methods. The implementers of early database systems, such as System R, chose to use a simple one-to-one mapping between the model and the physical storage. It was a natural choice as a fi…..

]]> By: Jack Orenstein http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/comment-page-1/#comment-70247 Jack Orenstein Fri, 01 Feb 2008 01:59:36 +0000 http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/#comment-70247 You missed three of my favorites. 1) skip-list: Neat alternative to balanced binary trees. 2) z-order (I did original research on this one): data transformation that turns any data structure supporting random and sequential access into a spatial data structure. 3) linear hashing. You missed three of my favorites.

1) skip-list: Neat alternative to balanced binary trees.

2) z-order (I did original research on this one): data transformation that turns any data structure supporting random and sequential access into a spatial data structure.

3) linear hashing.

]]>