MétaCan
Menu
Back to cohort
Record W1861900966 · doi:10.1109/hicss.1998.649226

Concurrency control of large unstructured data

2002· article· en· W1861900966 on OpenAlexaff
Gopi K. Attaluri, Jacob Slonim, Per-Åke Larson

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceConcurrency controlConcurrencyGranularityNon-lock concurrency controlDistributed computingOptimistic concurrency controlDistributed concurrency controlDatabaseDatabase transactionProgramming language

Abstract

fetched live from OpenAlex

Current research projects and database product extensions reflect the importance of unconventional database applications (for example, document processing and computer aided design). Unconventional applications differ from the conventional ones (for example, airline reservation) in the nature of transactions and data. The transactions may be complex, long and involve human interaction. The data includes small, structured objects as well as large, unstructured objects. The unstructured objects are stored in and managed by unstructured database management systems (UDS). UDS employs coarse-granularity locking which limit the concurrency and reduce the throughput of transactions. This paper deals with this problem of coarse-granularity locking at UDS. It proposes and investigates the logical concurrency control (LCC) concept as a solution. In LCC, a software module sits on top of the UDS and offers a higher-level service. This module employs application-domain-specific fine-granularity locking to achieve high concurrency.

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: Empirical · Consensus signal: none
Teacher disagreement score0.996
Threshold uncertainty score0.276

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.000
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.031
GPT teacher head0.262
Teacher spread0.231 · 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
GenreEmpirical

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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDistributed systems and fault toleranceFrench-language works237,207