On the public citation graph

Efficient Dual-Resolution Layer Indexing for Top-k Queries

0 signed · 46 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/978-3-540-77974-2openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/s00778-003-0099-8openalex-snapshot
Algorithms and applications for answering ranked queries using ranked views
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-155860869-6/50032-9openalex-snapshot
Shooting Stars in the Sky
inferredcites →https://doi.org/10.1016/j.ins.2009.05.016openalex-snapshot
The partitioned-layer index: Answering monotone top-k queries using the convex skyline and partitioning-merging technique
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/icde.2003.1260846openalex-snapshot
Skyline with presorting
inferredcites →https://doi.org/10.1109/icde.2008.4497462openalex-snapshot
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
inferredcites →https://doi.org/10.1109/icde.2010.5447890openalex-snapshot
Reverse top-k queries
inferredcites →https://doi.org/10.1109/icde.2010.5447908openalex-snapshot
The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces
inferredcites →https://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
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.1109/tkde.2010.240openalex-snapshot
Pareto-Based Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
inferredcites →https://doi.org/10.1145/1005566.1005569openalex-snapshot
Evaluating top- k queries over web-accessible databases
inferredcites →https://doi.org/10.1145/1206049.1206054openalex-snapshot
Optimizing top-k queries for middleware access
inferredcites →https://doi.org/10.1145/142675.142683openalex-snapshot
Linear optimization queries
inferredcites →https://doi.org/10.1145/1739041.1739067openalex-snapshot
BSkyTree
inferredcites →https://doi.org/10.1145/211990.212023openalex-snapshot
Why decision support fails and how to fix it
inferredcites →https://doi.org/10.1145/235815.235821openalex-snapshot
The quickhull algorithm for convex hulls
inferredcites →https://doi.org/10.1145/253260.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/253262.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/335191.335433openalex-snapshot
The onion technique
inferredcites →https://doi.org/10.1145/342009.335433openalex-snapshot
The onion technique
inferredcites →https://doi.org/10.1145/375663.375690openalex-snapshot
PREFER
inferredcites →https://doi.org/10.1145/564691.564731openalex-snapshot
Minimal probing
inferredcites →https://doi.org/10.1145/872757.872814openalex-snapshot
An optimal and progressive algorithm for skyline queries
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5555/1182635.1164149openalex-snapshot
Towards robust indexing for ranked queries
inferredcites →https://doi.org/10.5555/1182635.1164167openalex-snapshot
Answering top-k queries using views
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-32049-6_5openalex-snapshot
ListMerge: Accelerating Top-k Aggregation Queries Over Large Number of Lists
inferred← citeshttps://doi.org/10.1007/s00224-020-10009-6openalex-snapshot
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees
inferred← citeshttps://doi.org/10.1007/s10115-015-0836-5openalex-snapshot
TKAP: Efficiently processing top-k query on massive data by adaptive pruning
inferred← citeshttps://doi.org/10.1007/s11227-016-1826-4openalex-snapshot
Adaptive convex skyline: a threshold-based project partitioned layer-based index for efficient-processing top-k queries in entrepreneurship applications
inferred← citeshttps://doi.org/10.1007/s11280-016-0385-1openalex-snapshot
Subscription-based data aggregation techniques for top-k monitoring queries
inferred← citeshttps://doi.org/10.1109/tkde.2013.149openalex-snapshot
Toward Scalable Indexing for Top- \(k\) Queries
inferred← citeshttps://doi.org/10.1109/tkde.2015.2426691openalex-snapshot
Efficient Top-k Retrieval on Massive Data
inferred← citeshttps://doi.org/10.1145/2452376.2452433openalex-snapshot
Efficient top-k query answering using cached views
inferred← citeshttps://doi.org/10.1145/2791347.2791355openalex-snapshot
Distributed top-k query processing on multi-dimensional data with keywords
inferred← citeshttps://doi.org/10.14778/2732269.2732275openalex-snapshot
Computing k-regret minimizing sets
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2019.11openalex-snapshot
Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees
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.