On the public citation graph
Cost-Aware Rank Join with Random and Sorted Access
0 signed · 41 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.1006/jcss.1998.1600openalex-snapshot
Combining Fuzzy Information from Multiple Systems
inferredcites →https://doi.org/10.1007/978-3-642-16092-9_1openalex-snapshot
Search Computing Challenges and Directions
inferredcites →https://doi.org/10.1007/s00778-004-0128-2openalex-snapshot
Supporting top-k join queries in relational databases
inferredcites →https://doi.org/10.1007/s00778-008-0124-zopenalex-snapshot
Depth estimation for ranking query optimization
inferredcites →https://doi.org/10.1007/s00778-008-0127-9openalex-snapshot
Anytime measures for top-k algorithms on exact and fuzzy data sets
inferredcites →https://doi.org/10.1016/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1109/icde.2002.994751openalex-snapshot
Evaluating top-k queries over Web-accessible databases
inferredcites →https://doi.org/10.1109/icde.2009.109openalex-snapshot
Best-Effort Top-k Query Processing Under Budgetary Constraints
inferredcites →https://doi.org/10.1109/icde.2009.112openalex-snapshot
Leveraging COUNT Information in Sampling Hidden Databases
inferredcites →https://doi.org/10.1109/icde.2010.5447873openalex-snapshot
The similarity join database operator
inferredcites →https://doi.org/10.1109/itcc.2001.918866openalex-snapshot
Towards efficient multi-feature queries in heterogeneous environments
inferredcites →https://doi.org/10.1109/tkde.2004.60openalex-snapshot
Making the threshold algorithm access cost aware
inferredcites →https://doi.org/10.1109/tkde.2007.1007openalex-snapshot
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
inferredcites →https://doi.org/10.1145/1005566.1005569openalex-snapshot
Evaluating top- k queries over web-accessible databases
inferredcites →https://doi.org/10.1145/1007568.1007593openalex-snapshot
Rank-aware query optimization
inferredcites →https://doi.org/10.1145/1189769.1189772openalex-snapshot
Adaptive rank-aware query optimization in relational databases
inferredcites →https://doi.org/10.1145/1376916.1376924openalex-snapshot
Evaluating rank joins with optimal cost
inferredcites →https://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferredcites →https://doi.org/10.1145/1559845.1559890openalex-snapshot
Robust and efficient algorithms for rank join evaluation
inferredcites →https://doi.org/10.1145/182591.182594openalex-snapshot
On the relative cost of sampling for join selectivity estimation
inferredcites →https://doi.org/10.5555/1182635.1164169openalex-snapshot
IO-Top-k: index-access optimized top-k query processing
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-319-07443-6_10openalex-snapshot
Pay-as-you-go Approximate Join Top-k Processing for the Web of Data
inferred← citeshttps://doi.org/10.1007/978-3-319-31676-5_6openalex-snapshot
ERA-RJN: A SPARQL-Rank Based Top-k Join Query Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-61893-7_7openalex-snapshot
A Short Account of Techniques for Assisting Users in Mastering Big Data
inferred← citeshttps://doi.org/10.1007/978-3-642-35176-1_22openalex-snapshot
Efficient Execution of Top-K SPARQL Queries
inferred← citeshttps://doi.org/10.1016/j.future.2020.06.052openalex-snapshot
Top- k query optimization over data services
inferred← citeshttps://doi.org/10.1016/j.is.2016.09.004openalex-snapshot
Exploratory product search using top-k join queries
inferred← citeshttps://doi.org/10.1109/fskd.2015.7382300openalex-snapshot
A hybrid-architecture retrieval system based on Web Services
inferred← citeshttps://doi.org/10.1109/iciea.2017.8282985openalex-snapshot
SRJA: A research on optimizing top-k join queries based on spark
inferred← citeshttps://doi.org/10.1109/icmit47780.2020.9046996openalex-snapshot
Ranking queries optimization over external data sources
inferred← citeshttps://doi.org/10.1186/1471-2105-15-s1-s3openalex-snapshot
Explorative search of distributed bio-data to answer complex biomedical questions
inferred← citeshttps://doi.org/10.29268/iciot.2016.0018openalex-snapshot
Research on optimizing top-K join queries for RDF datasets based on spark
inferred← citeshttps://doi.org/10.3390/a18010029openalex-snapshot
Parallelizing the Computation of Grid Resistance to Measure the Strength of Skyline Tuples
inferred← citeshttps://doi.org/10.3390/data10050076openalex-snapshot
Computing Non-Dominated Flexible Skylines in Vertically Distributed Datasets with No Random Access
inferred← citeshttps://doi.org/10.35940/ijitee.j1065.08810s19openalex-snapshot
Efficient Processing of Queries using Filtered Bitmap Index with Multi-Join Multiple Set Predicates
inferred← citeshttps://doi.org/10.4018/ijwsr.2020100101openalex-snapshot
Towards Rank-Aware Data Mashups
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1117openalex-snapshot
Finding Heavy Paths in Graphs: A Rank Join Approach
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.