On the public citation graph
Pareto-Based Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
0 signed · 55 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.1995.1050openalex-snapshot
Query Size Estimation by Adaptive Sampling
inferredcites →https://doi.org/10.1006/jeth.1994.1068openalex-snapshot
A Foundation for Pareto Aggregation
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/b978-155860869-6/50032-9openalex-snapshot
Shooting Stars in the Sky
inferredcites →https://doi.org/10.1016/j.is.2005.12.001openalex-snapshot
Branch-and-bound processing of ranked queries
inferredcites →https://doi.org/10.1016/s0167-6377(02)00189-xopenalex-snapshot
Characterization of Pareto dominance
inferredcites →https://doi.org/10.1109/icde.1999.754894openalex-snapshot
Query processing issues in image (multimedia) databases
inferredcites →https://doi.org/10.1109/icde.2006.131openalex-snapshot
Robust Cardinality and Cost Estimation for Skyline Operator
inferredcites →https://doi.org/10.1109/icde.2006.54openalex-snapshot
Efficient Aggregation of Ranked Inputs
inferredcites →https://doi.org/10.1109/tkde.2009.157openalex-snapshot
Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks
inferredcites →https://doi.org/10.1145/235815.235821openalex-snapshot
The quickhull algorithm for convex hulls
inferredcites →https://doi.org/10.1145/298514.298540openalex-snapshot
Query size estimation by adaptive sampling (extended abstract)
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/872757.872814openalex-snapshot
An optimal and progressive algorithm for skyline queries
inferredcites →https://doi.org/10.1145/93597.93611openalex-snapshot
Practical selectivity estimation through adaptive sampling
inferredcites →https://doi.org/10.1145/93605.93611openalex-snapshot
Practical selectivity estimation through adaptive sampling
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.1164168openalex-snapshot
Answering top-k queries with multi-dimensional selections: the ranking cube approach
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/s00778-026-00972-wopenalex-snapshot
A framework for top-k queries with constrained preferences
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/s10619-012-7094-2openalex-snapshot
Distributed top-k query processing by exploiting skyline summaries
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.1016/j.knosys.2014.01.022openalex-snapshot
Approximate convex skyline: A partitioned layer-based index for efficient processing top-k queries
inferred← citeshttps://doi.org/10.1109/icccnt.2013.6726522openalex-snapshot
Performance analysis of branch-and-bound approach with various model-selection clustering techniques for image data point
inferred← citeshttps://doi.org/10.1109/icde.2012.73openalex-snapshot
Efficient Dual-Resolution Layer Indexing for Top-k Queries
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00017openalex-snapshot
Multi-attributed Community Search in Road-social Networks
inferred← citeshttps://doi.org/10.1109/iceeot.2016.7755216openalex-snapshot
Implementing and applying an indexing structure dominant graph for dominant relationship analysis
inferred← citeshttps://doi.org/10.1109/icmtma.2015.31openalex-snapshot
An Efficient Massive Data Retrieval Algorithm Based on Modified Top-k Query
inferred← citeshttps://doi.org/10.1109/isai.2016.0010openalex-snapshot
Top-k Query Based on Map Reduce
inferred← citeshttps://doi.org/10.1109/tkde.2013.149openalex-snapshot
Toward Scalable Indexing for Top- \(k\) Queries
inferred← citeshttps://doi.org/10.1109/tkde.2013.172openalex-snapshot
Close Dominance Graph: An Efficient Framework for Answering Continuous Top- \(k\) Dominating Queries
inferred← citeshttps://doi.org/10.1109/tkde.2015.2426691openalex-snapshot
Efficient Top-k Retrieval on Massive Data
inferred← citeshttps://doi.org/10.1145/2339530.2339599openalex-snapshot
Efficient and domain-invariant competitor mining
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.1145/3514221.3526182openalex-snapshot
T-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space
inferred← citeshttps://doi.org/10.14778/2732269.2732275openalex-snapshot
Computing k-regret minimizing sets
inferred← citeshttps://doi.org/10.14778/3204028.3204031openalex-snapshot
Exact processing of uncertain top-k queries in multi-criteria settings
inferred← citeshttps://doi.org/10.14778/3364324.3364327openalex-snapshot
Efficient main-memory top-K selection for multicore architectures
inferred← citeshttps://doi.org/10.1587/transinf.2015edp7377openalex-snapshot
Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
inferred← citeshttps://doi.org/10.24251/hicss.2021.211openalex-snapshot
Upgrading Products based on Existing Dominant Competitors
inferred← citeshttps://doi.org/10.5121/csit.2016.60400openalex-snapshot
Computer Science & Information Technology ( CS & IT )
inferred← citeshttps://doi.org/10.5121/csit.2016.60411openalex-snapshot
Associative Regressive Decision Rule Mining for Predicting Customer Satisfactory Patterns
inferred← citeshttps://doi.org/10.54254/2755-2721/105/2024tj0059openalex-snapshot
Optimizing Top-K query processing on GPU using data compression and pre-filtering
inferred← citeshttps://doi.org/10.5626/ktcp.2015.21.1.76openalex-snapshot
Efficient Top-k Query Processing Algorithm Using Grid Index-based View Selection Method
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.