MétaCan
Menu
Back to cohort
Record W2134971776 · doi:10.1109/ideas.2000.880582

Query result size estimation using the Trapezoidal Attribute Cardinality Map

2002· article· en· W2134971776 on OpenAlexaff
B. John Oommen, Murali Thiyagarajah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsCarleton University
Fundersnot available
KeywordsCardinality (data modeling)HistogramFunction (biology)Probability density functionQuery optimizationComputer scienceAlgorithmDensity estimationEstimationHeuristicMathematicsMathematical optimizationData miningImage (mathematics)Artificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Histogram techniques are used to efficiently estimate query result sizes in most of the modern-day database systems. In a recent work (Oommen and Thiyagarajah, 1999), we introduced a new histogram-like approximation strategy, called the Rectangular Attribute Cardinality Map (R-ACM), which approximates the density function within a given sector by a rectangular cell. In this paper, we introduce another histogram-like approximation strategy, called the Trapezoidal Attribute Cardinality Map (T-ACM) that approximates the density function within a given sector by a trapezoidal cell, where the slope of the trapezoid is obtained so as to fix the actual probability mass within the cell. We present numerous analytic and experimental results concerning the T-ACM demonstrating its superiority over the traditional equi-width and equi-depth histograms for query result size estimation. We hope that with the R-ACM introduced in (Oommen and Thiyagarajah, 1999), the T-ACM could become an invaluable tool for query optimization in the future database systems.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.975
Threshold uncertainty score0.368

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.057
GPT teacher head0.264
Teacher spread0.207 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207