Overview of Mini Search

Overview

Mini Search is a search engine developed on top of Minibase, a database management system intended for educational use. Mini Search reuses many major components from Minibase, as will be described below. The goal is similar to that of Minibase: to have an information system where the individual components can be studied and implemented by students.

Architecture

Frontend: Users interact with Mini Search with the either a command console or web browser.

Query Processor: The Mini Search query processor has specialized algorithms (query plans) for processing insertions of web page contents, as well as key word based search queries.

Heap Files: All data records are stored in heap files, which are files of unordered pages. This is a Minibase component.

B+ tree: Currently B+ Tree is the only index-based access method available. The access method in Minibase is dense, unclustered, and store key/rid-of-data-record pairs (Alternative 2, in terms of the text book). This is a Minibase component.

Buffer Manager: The buffer manager swaps pages in and out of the (main memory) buffer pool in response to requests from access method and the heap file component. This is a Minibase component.

Disk Space Manager: A database is a fixed size file managed by operating system, and pages (in the file) on disk are managed by the disk space manager. This is a Minibase component.

Page-1

References