Change search
ReferencesLink to record
Permanent link

Direct link
How to find a needle in a haystack: efficient searching
2001 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis provides a survey of search algorithms with application to database management. The focus of the thesis is on data structures and algorithms for large databases where several search keys are allowed for each record. The possibility and complexity of searching when only one of the keys is specified are examined for the structures. We can conclude that it is, in most structures, possible to perform such a search, but the I/O-complexity is often not optimal. Additionally, we present three highly efficient data structures for use in primary memory only.

Place, publisher, year, edition, pages
2001.
Keyword [en]
Technology, algorithms, search, databases, partial match, multikey, multidimensional, spatial databases
Keyword [sv]
Teknik
Identifiers
URN: urn:nbn:se:ltu:diva-51355ISRN: LTU-EX--01/215--SELocal ID: 89010e06-394f-4649-b0d1-4ab0275f6d62OAI: oai:DiVA.org:ltu-51355DiVA: diva2:1024716
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Examiners
Note
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

No full text

Search outside of DiVA

GoogleGoogle Scholar

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link