DATABASE SEARCHING USING TRAPEZE FETCH

Patent №

US 6,970,865

Granted

2005-11-29

Filed 2001

Owner

UNISYS CORPORATION

Lab

AI components

2

nlp · kr

Assignment

Recorded

Dataset

AIPD

2023_r1 edition

Application

10032915

A method and apparatus for improving search performance in databases organized in B Tree or B+ Tree format has an automatic determination and switching between two methods. It also searches to the end of a current leaf page even if a current value for all key parameters has been fulfilled in the search prior to reaching the end of the current leaf page. Swinging across and thus skipping leaf pages to fetch a next leaf page (trapeze fetching or swinging) is activated only either initially or where a B Tree search has resulted in a skipping of leaf pages previously in a search. User interference with the automatic selection of search type between next sequential leaf or trapeze type is not provided for and not allowed.

Natural languageKnowledge representationG06F 16/2246Y10S 707/99933Y10S 707/99936

AI classification

Natural language0.58
Knowledge representation0.54
Evolutionary computation0.02
Planning0.01
Vision0.01
AI hardware0.00
Machine learning0.00
Speech0.00

Ownership

UNISYS CORPORATION

assignment · 126920179

Assignors

PLASEK, JAMES M., SMITH, JENNIFER J., SANDIN, JOSEPH M.

On an employer assignment, the assignors are typically the inventors.

© 2026 NYSGPT2525 LLC