Article View: ont.events
Article #460More UofT DCS Seminars (week of Oct. 17th)
From: Phyllis Eve Bregman
Date: Mon, 17 Oct 1983 15:44
Date: Mon, 17 Oct 1983 15:44
23 lines
1618 bytes
1618 bytes
**MORE**
UofT Department of Computer Science Seminar Schedule for
the week of October 17th, 1983
Thursday, October 20th, 2:00 P.M., GB248: Prof. Markuu Tamminen,
Helsinki University of Technology, Laboratory of Information Processing
Science, Helsinki, Finland: "On search by address computation".
ABSTRACT: We study the effect of data distribution on the efficiency
of address computation data structures for searching, as typified by
the priority queue problem. We present a comparison of several different
techniques and show that, in contrast to sorting, neither one nor
multilevel bucket methods are uniformly efficient for the above task.
As a remedy we propose an enhancement of order preserving extendible
hashing. This structure is shown to behave asymptotically independently
of the amount of data and its distribution. From the one-dimensional
analysis we draw conclusions regarding multi-attribute file structures.
--
Phyllis Eve Bregman
CSRG, Univ. of Toronto
{decvax,linus,ihnp4,uw-beaver,floyd,utzoo}!utcsrgv!phyllis
Technical Details
Message-ID:
<2510@utcsrgv.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!utcsrgv!phyllisShow Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83; site utcsrgv.UUCP Path: arc1-ca.pugleaf.net!utzoo!utcsrgv!phyllis From: phyllis@utcsrgv.UUCP (Phyllis Eve Bregman) Newsgroups: ont.events Subject: More UofT DCS Seminars (week of Oct. 17th) Message-ID: <2510@utcsrgv.UUCP> Date: Mon, 17-Oct-83 11:44:55 EDT Article-I.D.: utcsrgv.2510 Posted: Mon Oct 17 11:44:55 1983 Date-Received: Mon, 17-Oct-83 12:29:54 EDT Organization: CSRG, University of Toronto Lines: 23