On the public citation graph
Exploiting early sorting and early partitioning for decision support query processing
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s007780050043openalex-snapshot
S eek ing the truth about ad hoc join costs
inferredcites →https://doi.org/10.1023/a:1009726021843openalex-snapshot
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
inferredcites →https://doi.org/10.1109/icde.1994.283062openalex-snapshot
Sort-merge-join: an idea whose time has(h) passed?
inferredcites →https://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational databases
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/211990.212001openalex-snapshot
Multi-table joins through bitmapped join indices
inferredcites →https://doi.org/10.1145/233269.233320openalex-snapshot
Fundamental techniques for order optimization
inferredcites →https://doi.org/10.1145/253260.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/276304.276329openalex-snapshot
Simultaneous optimization and evaluation of multiple dimensional queries
inferredcites →https://doi.org/10.1145/276304.276336openalex-snapshot
Bitmap index design and evaluation
inferredcites →https://doi.org/10.1145/319983.319987openalex-snapshot
Duplicate record elimination in large data files
inferredcites →https://doi.org/10.1145/320248.320249openalex-snapshot
Optimization of queries with user-defined predicates
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/6314.6315openalex-snapshot
Join processing in database systems with large main memories
inferredcites →https://doi.org/10.1145/971701.50204openalex-snapshot
Grammar-like functional rules for representing query optimization alternatives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-30501-9_9openalex-snapshot
Data Mining Techniques in Materialised Project and Selection View
inferred← citeshttps://doi.org/10.1007/978-3-540-44999-7_31openalex-snapshot
Data Mining Techniques in Materialised Projection View
inferred← citeshttps://doi.org/10.1007/s00778-011-0240-zopenalex-snapshot
Which sort orders are interesting?
inferred← citeshttps://doi.org/10.1007/s00778-025-00906-yopenalex-snapshot
Join optimization revisited: a novel DP algorithm for join&sort order selection
inferred← citeshttps://doi.org/10.1016/b978-012722442-8/50078-1openalex-snapshot
Avoiding Sorting and Grouping In Processing Queries
inferred← citeshttps://doi.org/10.1023/b:wwwj.0000047379.18584.31openalex-snapshot
Building Scalable Electronic Market Places Using HyperQuery-Based Distributed Query Processing
inferred← citeshttps://doi.org/10.1080/1206212x.2004.11441743openalex-snapshot
Sensitivity Analysis of Database Operations: A Case Study of Parallel Partition/Sorting Algorithm
inferred← citeshttps://doi.org/10.1109/nas.2009.19openalex-snapshot
Group-by Query Process in Middleware of Large Scale Data Intensive Systems
inferred← citeshttps://doi.org/10.1109/tkde.2010.266openalex-snapshot
Saturn: Range Queries, Load Balancing and Fault Tolerance in DHT Data Systems
inferred← citeshttps://doi.org/10.1145/1142473.1142481openalex-snapshot
Supporting ad-hoc ranking aggregates
inferred← citeshttps://doi.org/10.1145/1559845.1559947openalex-snapshot
Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15
inferred← citeshttps://doi.org/10.14778/2336664.2336678openalex-snapshot
Massively parallel sort-merge joins in main memory multi-core database systems
inferred← citeshttps://doi.org/10.1504/ijram.2012.047577openalex-snapshot
A disaster warning model for a spacecraft launch based on information fusion and network inference
inferred← citeshttps://doi.org/10.2316/journal.202.2004.4.202-1260openalex-snapshot
Sensitivity Analysis of Database Operations: A Case Study of Parallel Partition/Sorting Algorithm
inferred← citeshttps://doi.org/10.3929/ethz-a-010598789openalex-snapshot
Data Analytics in a Data- and Hardware-Conscious Way
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0508openalex-snapshot
Optimization and Evaluation of Nested Queries and Procedures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.