- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 31 to 40 of 481 (0.078 seconds)| 31 |
Algorithms and data structures for the implimentation of a relational database systemOrenstein, J. A. January 1982 (has links)
The problems of implementing a relational database are considered. In part 1, a new class of data structures for processing range queries is described. A member of this class is derived from a data structure which supports random and sequential accessing. We also describe two new data structures with this property that seem to have better performance than the Btree. In part 2, a new design for the physical database is proposed. This design is based on the separation of a relation into two parts: a static "master file" and a dynamic "differential file" which stores updates. Our design includes a new system for recovering from system failures and allows greater concurrency than is possible with existing systems.
|
| 32 |
Sequential and parallel algorithms for the generalized maximum subarray problem : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science in the University of Canterbury /Bae, Sung Eun. January 2007 (has links)
Thesis (Ph. D.)--University of Canterbury, 2007. / Typescript (photocopy). Includes bibliographical references (p. 212-223). Also available via the World Wide Web.
|
| 33 |
The representation of symmetric patterns using the Quadtree data structure /Lodolini, Lucia. January 1988 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1988. / Includes bibliographical references (leaves 101-103).
|
| 34 |
Quadtree algorithms for image processing /Benjamin, Jim Isaac. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references (leaves 48-50).
|
| 35 |
Data structures and algorithms for data representation in constrained environmentsKarras, Panagiotis. January 2007 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.
|
| 36 |
Timber Ho! an examination of the properties of special balanced search trees /Barkan, David. January 1900 (has links)
Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2002. / Includes bibliographical references.
|
| 37 |
A paging scheme for pointer-based quadtrees /Brown, Patrick R., January 1992 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 72-74). Also available via the Internet.
|
| 38 |
Expected-case planar point location /Malamatos, Theocharis. January 2002 (has links)
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 80-83). Also available in electronic version. Access restricted to campus users.
|
| 39 |
Fast labeled tree comparison via better matching algorithms /Sung, Wing-kin. January 1998 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1999. / Includes bibliographical references (leaves 90-93).
|
| 40 |
Trading off time for space for the string matching problem /Lai, Shiao-bun. January 1996 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 64-66).
|
Page generated in 0.0834 seconds