On the public citation graph

Efficient Aggregation of Ranked Inputs

0 signed · 45 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.1006/jcss.1998.1600openalex-snapshot
Combining Fuzzy Information from Multiple Systems
inferredcites →https://doi.org/10.1007/s00778-004-0128-2openalex-snapshot
Supporting top-k join queries in relational databases
inferredcites →https://doi.org/10.1016/b978-012088469-8.50058-9openalex-snapshot
Top-k Query Evaluation with Probabilistic Guarantees
inferredcites →https://doi.org/10.1016/b978-012722442-8/50072-0openalex-snapshot
Supporting Top-k Join Queries in Relational Databases
inferredcites →https://doi.org/10.1016/b978-155860869-6/50094-9openalex-snapshot
Joining Ranked Inputs in Practice
inferredcites →https://doi.org/10.1016/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1109/icde.1999.754894openalex-snapshot
Query processing issues in image (multimedia) databases
inferredcites →https://doi.org/10.1109/icde.2001.914855openalex-snapshot
The Skyline operator
inferredcites →https://doi.org/10.1109/icde.2002.994751openalex-snapshot
Evaluating top-k queries over Web-accessible databases
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.2007.1007openalex-snapshot
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
inferredcites →https://doi.org/10.1145/1007568.1007593openalex-snapshot
Rank-aware query optimization
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/564691.564731openalex-snapshot
Minimal probing
inferredcites →https://doi.org/10.1145/872757.872795openalex-snapshot
Efficient similarity search and classification via rank aggregation

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-030-69377-0_10openalex-snapshot
Optimal Placement of Taxis in a City Using Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-21257-9_6openalex-snapshot
Indexing for Similarity Search Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-23088-2_28openalex-snapshot
A General Top-k Algorithm for Web Data Sources
inferred← citeshttps://doi.org/10.1007/978-3-642-28314-7_16openalex-snapshot
Top-k Algorithm Based on Extraction
inferred← citeshttps://doi.org/10.1007/978-3-642-40285-2_22openalex-snapshot
Generic Top-k Query Processing with Breadth-First Strategies
inferred← citeshttps://doi.org/10.1007/978-3-662-45714-6_2openalex-snapshot
Slicing the Dimensionality: Top-k Query Processing for High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/978-3-662-46485-4_3openalex-snapshot
Exact and Approximate Generic Multi-criteria Top-k Query Processing
inferred← citeshttps://doi.org/10.1007/s00778-009-0174-xopenalex-snapshot
Efficient processing of exact top-k queries over disk-resident sorted lists
inferred← citeshttps://doi.org/10.1007/s11115-021-00594-6openalex-snapshot
Trust Mediates the Relationship Between Stakeholder Behavior and Stakeholder Management of Public Private Partnership Projects in Uganda
inferred← citeshttps://doi.org/10.1007/s11227-021-04005-xopenalex-snapshot
Top-k dominating queries on incomplete large dataset
inferred← citeshttps://doi.org/10.1109/access.2018.2797048openalex-snapshot
Finding Top- $k$ Dominance on Incomplete Big Data Using MapReduce Framework
inferred← citeshttps://doi.org/10.1109/icde.2007.368966openalex-snapshot
Top-k Spatial Preference Queries
inferred← citeshttps://doi.org/10.1109/icde.2008.4497462openalex-snapshot
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
inferred← citeshttps://doi.org/10.1109/icde.2010.5447818openalex-snapshot
Supporting top-K keyword search in XML databases
inferred← citeshttps://doi.org/10.1109/icde.2017.113openalex-snapshot
Monitoring the Top-m Rank Aggregation of Spatial Objects in Streaming Queries
inferred← citeshttps://doi.org/10.1109/socialcom-passat.2012.103openalex-snapshot
Authenticated Top-K Aggregation in Distributed and Outsourced Databases
inferred← citeshttps://doi.org/10.1109/tkde.2009.44openalex-snapshot
Object and Combination Shedding Schemes for Adaptive Media Workflow Execution
inferred← citeshttps://doi.org/10.1109/tkde.2010.240openalex-snapshot
Pareto-Based Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
inferred← citeshttps://doi.org/10.1109/tkde.2011.60openalex-snapshot
SPARK2: Top-k Keyword Query in Relational Databases
inferred← citeshttps://doi.org/10.1145/1247480.1247495openalex-snapshot
Spark
inferred← citeshttps://doi.org/10.1145/1272743.1272749openalex-snapshot
Efficient top- k aggregation of ranked inputs
inferred← citeshttps://doi.org/10.1145/1353343.1353388openalex-snapshot
Efficient online top-K retrieval with arbitrary similarity measures
inferred← citeshttps://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferred← citeshttps://doi.org/10.1145/1989323.1989386openalex-snapshot
Efficient and generic evaluation of ranked queries
inferred← citeshttps://doi.org/10.1145/2348283.2348333openalex-snapshot
Supporting efficient top-k queries in type-ahead search
inferred← citeshttps://doi.org/10.1145/2513591.2513645openalex-snapshot
Top-kjoin queries
inferred← citeshttps://doi.org/10.14257/ijdta.2016.9.3.16openalex-snapshot
An Effective K-Nearest Neighbor Track Retrieval Algorithm
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.785openalex-snapshot
Efficient Indexing for Structured and Unstructured Data
inferred← citeshttps://doi.org/10.5121/csit.2013.3415openalex-snapshot
Enhancing Keyword Search Over Relational Databases Using Ontologies
inferred← citeshttps://doi.org/10.70675/183a5d5fzf135z4157z9308z6fb6d6ab141aopenalex-snapshot
Privacy preserving top-k query processing over outsourced data
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.