skip to content
Practical selectivity estimation through adaptive sampling Preview this item
ClosePreview this item
Checking...

Practical selectivity estimation through adaptive sampling

Author: Richard J Lipton; Jeffrey F Naughton; Donovan A Schneider
Publisher: Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept., 1990.
Series: University of Wisconsin--Madison.; Computer Sciences Department.; Computer sciences technical report
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Recently we have proposed an adaptive, random sampling algorithm for general query size estimation. In earlier work we analyzed the asymptotic efficiency and accuracy of the algorithm; in this paper we investigate its practicality as applied to selects and joins. First, we extend our previous analysis to provide significantly improved bounds on the amount of sampling necessary for a given level of  Read more...
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 J Lipton; Jeffrey F Naughton; Donovan A Schneider
OCLC Number: 21996801
Notes: Cover title.
"March 1990."
Description: 21 pages : illustrations ; 28 cm.
Series Title: University of Wisconsin--Madison.; Computer Sciences Department.; Computer sciences technical report
Responsibility: by Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider.

Abstract:

Abstract: "Recently we have proposed an adaptive, random sampling algorithm for general query size estimation. In earlier work we analyzed the asymptotic efficiency and accuracy of the algorithm; in this paper we investigate its practicality as applied to selects and joins. First, we extend our previous analysis to provide significantly improved bounds on the amount of sampling necessary for a given level of accuracy. Next, we provide 'sanity bounds' to deal with queries for which the underlying data is extremely skewed or the query result is very small. Finally, we report on the performance of the estimation algorithm as implemented in a host language on a commercial relational system. The results are encouraging, even with this loose coupling between the estimation algorithm and the DBMS."

Reviews

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

Tags

Be the first.

Similar Items

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/21996801>
library:oclcnum"21996801"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1990"
schema:description"Abstract: "Recently we have proposed an adaptive, random sampling algorithm for general query size estimation. In earlier work we analyzed the asymptotic efficiency and accuracy of the algorithm; in this paper we investigate its practicality as applied to selects and joins. First, we extend our previous analysis to provide significantly improved bounds on the amount of sampling necessary for a given level of accuracy. Next, we provide 'sanity bounds' to deal with queries for which the underlying data is extremely skewed or the query result is very small. Finally, we report on the performance of the estimation algorithm as implemented in a host language on a commercial relational system. The results are encouraging, even with this loose coupling between the estimation algorithm and the DBMS.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/23904506>
schema:inLanguage"en"
schema:isPartOf
schema:name"Practical selectivity estimation through adaptive sampling"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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