Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Query size estimation by adaptive sampling

From MaRDI portal
Publication:1900915
Jump to:navigation, search

DOI10.1006/jcss.1995.1050zbMath0831.68035OpenAlexW1972223681MaRDI QIDQ1900915

Richard J. Lipton, Jeffrey F. Naughton

Publication date: 13 February 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1050

zbMATH Keywords

datalog queriesrandom sampling algorithm


Mathematics Subject Classification ID

Database theory (68P15)


Related Items

A random sampling approach to worst-case design of structures, Analysis and application of adaptive sampling, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, Efficient sampling strategies for relational database operations, Tracking join and self-join sizes in limited storage, Uniform generation in spatial constraint databases and applications, A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph, SchemaSQL, Perfect $L_p$ Sampling in a Data Stream, Sequential sampling techniques for algorithmic learning theory



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1900915&oldid=14310903"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki