skip to content
Deferred data structuring Preview this item
ClosePreview this item
Checking...

Deferred data structuring

Author: Richard M Karp; Rajeev Motwani; Prabhakar Raghavan
Publisher: Berkeley, CA. : University of California. Computer Science Division, 1986.
Series: University of California, Berkeley.; Computer Science Division.; Report
Edition/Format:   Book : English
Database:WorldCat
Summary:
We consider the problem of answering a series of on- line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries. Our approach involves dynamic or query driven structuring of the data set; our algorithm
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Richard M Karp; Rajeev Motwani; Prabhakar Raghavan
OCLC Number: 16902032
Description: 30 pages : illustrations ; 28 cm.
Series Title: University of California, Berkeley.; Computer Science Division.; Report
Responsibility: Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan.

Abstract:

We consider the problem of answering a series of on- line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries. Our approach involves dynamic or query driven structuring of the data set; our algorithm processes the data set only when doing so is required for answering a query. A data structure constructed progressively in this fashion is called a deferred data structure.

We develop the notion of deferred data structures by solving the problem of answering membership queries on an ordered set. We obtain a randomized algorithm which achieves asymptotically optimal performance with high probability. We then present optimal deferred data structures for the following problems in the plane: testing convex hull membership, half-plane intersection queries and fixed- constraint multi-objective linear programming. We also apply the deferred data structuring technique to multidimensional dominance query problems.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/16902032>
library:oclcnum"16902032"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/16902032>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1986"
schema:description"We develop the notion of deferred data structures by solving the problem of answering membership queries on an ordered set. We obtain a randomized algorithm which achieves asymptotically optimal performance with high probability. We then present optimal deferred data structures for the following problems in the plane: testing convex hull membership, half-plane intersection queries and fixed- constraint multi-objective linear programming. We also apply the deferred data structuring technique to multidimensional dominance query problems."@en
schema:description"We consider the problem of answering a series of on- line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries. Our approach involves dynamic or query driven structuring of the data set; our algorithm processes the data set only when doing so is required for answering a query. A data structure constructed progressively in this fashion is called a deferred data structure."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/13110701>
schema:inLanguage"en"
schema:name"Deferred data structuring"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.