Method and apparatus for pointer compression in structured datab

Details Method and apparatus for pointer compression in structured datab Method and apparatus for pointer compression in structured datab

1990-05-23

1994-01-04

Kulik, Paul V.

Boots, shoes, and leggings

36471502, 364DIG1, 3642516, 3642821, 3642823, G06F 1540

Patent

active

052768686

ABSTRACT:
A method and apparatus for addressing compressed nodes in a database structure is disclosed in which each compressed node is associated with a particular mapping function and each element in the node is assigned a particular identification code. The character to be searched is converted into a physical address having a first portion which is used to index to a particular element in a compressed node, and a second portion which is used to verify that the selected element corresponds to the search character.

REFERENCES:
patent: 3593309 (1971-07-01), Clark et al.
patent: 4507752 (1985-03-01), McKenna et al.
patent: 4817036 (1989-03-01), Millett et al.
patent: 5105353 (1992-04-01), Charles et al.
Algorithms for Trie Compaction, Ai-Suwaiyel, ACM Transactions on Database Systems, vol. 9, No. 2, Jun. 1984, pp. 243-263.
Efficient On-Line Construction and Correction of Position Trees, Majster et al., Siam J. Computing, vol. 9, No. 4, Nov. 1980.

Affiliated with

Also associated with

Rating

Method and apparatus for pointer compression in structured datab does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for pointer compression in structured datab, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for pointer compression in structured datab will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-315654