skip to content
Lower bounds for set intersection queries Preview this item
ClosePreview this item
Checking...

Lower bounds for set intersection queries

Author: Paul Frederick Dietz; Max-Planck-Institut für Informatik.; et al
Publisher: Saarbrücken, Germany : Max-Planck-Institut für Informatik, [1992]
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "We consider the following set intersection reporting problem. We have a collection of initially empty sets and would like to process an intermixed sequence of n updates (insertions into and deletions from individual sets) and q queries (reporting the intersection of two sets). We cast this problem in the arithmetic model of computation of Fredman [Fre81] and Yao [Yao85] and show that any algorithm that
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: Paul Frederick Dietz; Max-Planck-Institut für Informatik.; et al
OCLC Number: 30542416
Notes: "October 1992."
"MPI-I-92-127."
Description: 14 leaves ; 30 cm.
Responsibility: P. Dietz ... [et al.].

Abstract:

Abstract: "We consider the following set intersection reporting problem. We have a collection of initially empty sets and would like to process an intermixed sequence of n updates (insertions into and deletions from individual sets) and q queries (reporting the intersection of two sets). We cast this problem in the arithmetic model of computation of Fredman [Fre81] and Yao [Yao85] and show that any algorithm that fits in this model must take time [omega](q + n[square root of]q) to process a sequence of n updates and q queries, ignoring factors that are polynomial in log n. We show that this bound is tight in this model of computation, again to within a polynomial in log n factor, improving upon a result of Yellin [Yel92].

Furthermore we consider the case q = O(n) with an additional space restriction. We only allow to use m memory locations, where m [<or =] n[superscript 3/2]. We show a tight bound of [theta](n²m[superscript 1/3]) for a sequence of O(n) operations, again ignoring polynomial in log n factors."

Reviews

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

Tags

Be the first.

Similar Items

Related Subjects:(1)

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/30542416>
library:oclcnum"30542416"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/30542416>
rdf:typeschema:Book
schema:about
schema:contributor
schema:contributor
schema:datePublished"1992"
schema:description"Furthermore we consider the case q = O(n) with an additional space restriction. We only allow to use m memory locations, where m ["@en
schema:description"Abstract: "We consider the following set intersection reporting problem. We have a collection of initially empty sets and would like to process an intermixed sequence of n updates (insertions into and deletions from individual sets) and q queries (reporting the intersection of two sets). We cast this problem in the arithmetic model of computation of Fredman [Fre81] and Yao [Yao85] and show that any algorithm that fits in this model must take time [omega](q + n[square root of]q) to process a sequence of n updates and q queries, ignoring factors that are polynomial in log n. We show that this bound is tight in this model of computation, again to within a polynomial in log n factor, improving upon a result of Yellin [Yel92]."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/897973328>
schema:inLanguage"en"
schema:name"Lower bounds for set intersection queries"@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.