Succinct and I/O Efficient Data Structures for Traversal in Trees

Author： Dillabaugh Craig   He Meng   Maheshwari Anil  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 201-223

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

‘Perfectly’ Scalable Data I/O

By Orszag Steven   Goldhirsch Isaac   Srinivasan Sudhir  

Journal of Scientific Computing, Vol. 24, Iss. 3, 2005-09 ,pp. : 373-404

Springer Publishing Company

Access to resources Recommend Favorite

RIOS: efficient I/O in reverse direction

By  

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 45, Iss. 10, 2015-10 ,pp. : 1399-1427

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Data-Space Partitioning of Spatial Data for Parallel I/O

By Ferhatosmanoğlu Hakan   Agrawal Divyakant   Eğecioğlu Ömer   Abbadi Amr El  

Distributed and Parallel Databases, Vol. 17, Iss. 1, 2005-01 ,pp. : 75-101

Springer Publishing Company

Access to resources Recommend Favorite

A distributed multi-storage I/O system for data intensive scientific computing

By Shen X.   Choudhary A.  

Parallel Computing, Vol. 29, Iss. 11, 2003-11 ,pp. : 1623-1643

Elsevier

Access to resources Recommend Favorite

Data structures and algorithms for tilings I

By Delgado-Friedrichs O.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 431-445

Elsevier

Access to resources Recommend Favorite