Query evaluation techniques for large databases
G Graefe - ACM Computing Surveys (CSUR), 1993 - dl.acm.org
Database management systems will continue to manage large data volumes. Thus, efficient
algorithms for accessing and manipulating large sets and sequences will be required to …
algorithms for accessing and manipulating large sets and sequences will be required to …
External memory algorithms and data structures: Dealing with massive data
JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
[图书][B] Algorithmen und datenstrukturen
P Widmayer, T Ottmann - 1993 - Springer
Im Zentrum des Interesses der Informatik hat sich in den letzten Jahren das Gebiet
Algorithmen und Datenstrukturen beachtlich entwickelt. Dabei geht es sowohl um den …
Algorithmen und Datenstrukturen beachtlich entwickelt. Dabei geht es sowohl um den …
[图书][B] A practical introduction to data structures and algorithm analysis
CA Shaffer - 1997 - people.cs.vt.edu
We study data structures so that we can learn to write more efficient programs. But why must
programs be efficient when new computers are faster every year? The reason is that our …
programs be efficient when new computers are faster every year? The reason is that our …
Algorithms and data structures for external memory
JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
LH*—a scalable, distributed data structure
W Litwin, MA Neimat, DA Schneider - ACM Transactions on Database …, 1996 - dl.acm.org
We present a scalable distributed data structure called LH*. LH* generalizes Linear Hashing
(LH) to distributed RAM and disk files. An LH* file can be created from records with primary …
(LH) to distributed RAM and disk files. An LH* file can be created from records with primary …
[图书][B] Advanced data structures
P Brass - 2008 - s2.bitdl.ir
This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …
realize a set of operations on some data. The classical example is to keep track of a set of …
LH: linear hashing for distributed files
W Litwin, MA Neimat, DA Schneider - Proceedings of the 1993 ACM …, 1993 - dl.acm.org
LH* generalizes Linear Hashing to parallel or distributed RAM and disk files. An LH* file can
be created from objects provided by any number of distributed and autonomous clients. It …
be created from objects provided by any number of distributed and autonomous clients. It …
Data compression apparatus and method
DL Whiting, GA George, GE Ivey - US Patent 5,506,580, 1996 - Google Patents
An apparatus and method are disclosed for converting an input data character stream into a
variable length encoded data stream in a data compression system. The data com pression …
variable length encoded data stream in a data compression system. The data com pression …