On the public citation graph

Progressive Query Optimization for Federated Queries

0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-57818-8_58openalex-snapshot
On the estimation of join result sizes
inferredcites →https://doi.org/10.1007/s007780050026openalex-snapshot
Query processing and optimization in Oracle Rdb
inferredcites →https://doi.org/10.1016/s0898-1221(98)91137-3openalex-snapshot
Distributed and parallel databases
inferredcites →https://doi.org/10.1023/a:1008603331221openalex-snapshot
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
inferredcites →https://doi.org/10.1109/icde.1994.283004openalex-snapshot
Mariposa: a new architecture for distributed data
inferredcites →https://doi.org/10.1109/icde.2003.1260805openalex-snapshot
Using state modules for adaptive query processing
inferredcites →https://doi.org/10.1145/1007568.1007613openalex-snapshot
Adapting to source properties in processing data integration queries
inferredcites →https://doi.org/10.1145/1007568.1007642openalex-snapshot
Robust query processing through progressive optimization
inferredcites →https://doi.org/10.1145/1066157.1066171openalex-snapshot
Proactive re-optimization
inferredcites →https://doi.org/10.1145/153850.153872openalex-snapshot
Multiple join size estimation by virtual domains (extended abstract)
inferredcites →https://doi.org/10.1145/276304.276315openalex-snapshot
Efficient mid-query re-optimization of sub-optimal query execution plans
inferredcites →https://doi.org/10.1145/276304.276317openalex-snapshot
Cost-based query scrambling for initial delays
inferredcites →https://doi.org/10.1145/329.318578openalex-snapshot
Implications of certain assumptions in database performance evauation
inferredcites →https://doi.org/10.1145/335191.335390openalex-snapshot
Answering complex SQL queries using automatic summary tables
inferredcites →https://doi.org/10.1145/335191.335420openalex-snapshot
Eddies
inferredcites →https://doi.org/10.1145/342009.335390openalex-snapshot
Answering complex SQL queries using automatic summary tables
inferredcites →https://doi.org/10.1145/342009.335420openalex-snapshot
Eddies
inferredcites →https://doi.org/10.1145/564691.564723openalex-snapshot
Partial results for online query processing
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/582096.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/62032.62034openalex-snapshot
On estimating the cardinality of the projection of a database relation
inferredcites →https://doi.org/10.1145/66926.66960openalex-snapshot
Dynamic query evaluation plans
inferredcites →https://doi.org/10.1145/67544.66960openalex-snapshot
Dynamic query evaluation plans

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-031-41623-1_13openalex-snapshot
An SQL-Based Declarative Process Mining Framework for Analyzing Process Data Stored in Relational Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-28323-9_9openalex-snapshot
Adaptive Query Processing in Distributed Settings
inferred← citeshttps://doi.org/10.1007/s00778-007-0090-xopenalex-snapshot
Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options
inferred← citeshttps://doi.org/10.1007/s00778-020-00612-xopenalex-snapshot
RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems
inferred← citeshttps://doi.org/10.1007/springerreference_63891openalex-snapshot
Adaptive Query Processing
inferred← citeshttps://doi.org/10.1109/icac.2006.1662402openalex-snapshot
Autonomic Query Parallelization using Non-dedicated Computers: An Evaluation of Adaptivity Options
inferred← citeshttps://doi.org/10.1145/1247480.1247569openalex-snapshot
Progressive optimization in a shared-nothing parallel database
inferred← citeshttps://doi.org/10.1145/1516360.1516458openalex-snapshot
Time-completeness trade-offs in record linkage using adaptive query processing
inferred← citeshttps://doi.org/10.1145/1559845.1559910openalex-snapshot
ROX
inferred← citeshttps://doi.org/10.14778/3681954.3682018openalex-snapshot
Saving Money for Analytical Workloads in the Cloud
inferred← citeshttps://doi.org/10.1561/9781601980359openalex-snapshot
Adaptive Query Processing
inferred← citeshttps://doi.org/10.2200/s00878ed1v01y201810dtm052openalex-snapshot
Data Profiling
inferred← citeshttps://doi.org/10.3990/1.9789036531115openalex-snapshot
ROX : Run-Time Opitization of XQueries
inferred← citeshttps://doi.org/10.5555/1182635.1164237openalex-snapshot
POP/FED: progressive query optimization for federated queries in DB2
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.