Data Indexing and Filtering Techniques for Big Data Systems
Bibliographic record
Abstract
Data are an important resource for enterprises, scientists, and engineers. Two types of data management techniques are discussed in Chapter 9: indexing and filtering. Indexing reduces the latency of performing searches on a document set with a large volume. An index identifies the list of documents that contain a specific keyword. The well-known inverted indexing technique and a newer graph-based indexing technique are described. Their usefulness in the context of both simple and complex queries is discussed. The second part of the chapter focuses on data filtering. Often, the user is interested in a certain subset of data characterized by specific keywords. Only the filtered data are stored for future searches by the user's applications. Since the data volume is significantly reduced, the latency associated with searches is much smaller than that achieved when the full raw data are searched. Parallel processing-based data filtering techniques are discussed.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.005 | 0.010 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.011 | 0.008 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".