By Topic

A New Method for Fast Data Searches with Keys

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Litwin, W. ; National Research Institute ; Lomet, D.B.

Bounded disorder uses hashing and tree indexing to speed key-associative access to data. It supports range searches and is robust, coping well with arbitrary key distributions.

Published in:

Software, IEEE  (Volume:4 ,  Issue: 2 )