On the public citation graph

Efficient All Top-k Computation - A Unified Solution for All Top-k, Reverse Top-k and Top-m Influential Queries

0 signed · 62 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/s00454-002-0745-8openalex-snapshot
NP -Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes
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.1007/s007780100054openalex-snapshot
Answering queries using views: A survey
inferredcites →https://doi.org/10.1016/b978-0-08-016160-0.50028-2openalex-snapshot
ELEMENTS OF ALGEBRAIC TOPOLOGY
inferredcites →https://doi.org/10.1016/j.is.2005.12.001openalex-snapshot
Branch-and-bound processing of ranked queries
inferredcites →https://doi.org/10.1109/icde.2001.914855openalex-snapshot
The Skyline operator
inferredcites →https://doi.org/10.1109/icde.2008.4497444openalex-snapshot
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
inferredcites →https://doi.org/10.1109/icde.2010.5447890openalex-snapshot
Reverse top-k queries
inferredcites →https://doi.org/10.1109/ssdbm.2004.12openalex-snapshot
All-nearest-neighbors queries in spatial databases
inferredcites →https://doi.org/10.1109/ssdm.2004.1311221openalex-snapshot
All-nearest-neighbors queries in spatial databases
inferredcites →https://doi.org/10.1109/tit.1969.1054385openalex-snapshot
Space-filling curves: Their generation and their application to bandwidth reduction
inferredcites →https://doi.org/10.1109/tkde.2011.50openalex-snapshot
Monochromatic and Bichromatic Reverse Top-k Queries
inferredcites →https://doi.org/10.1145/1061318.1061320openalex-snapshot
Progressive skyline computation in database systems
inferredcites →https://doi.org/10.1145/1142473.1142547openalex-snapshot
DADA
inferredcites →https://doi.org/10.1145/1559845.1559897openalex-snapshot
Scalable skyline computation using object-based space partitioning
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/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/375663.375690openalex-snapshot
PREFER
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1201/9780429493911openalex-snapshot
Elements of Algebraic Topology
inferredcites →https://doi.org/10.14778/1687627.1687641openalex-snapshot
Promotion analysis in multi-dimensional space
inferredcites →https://doi.org/10.14778/1687627.1687713openalex-snapshot
Group recommendation
inferredcites →https://doi.org/10.14778/1687627.1687729openalex-snapshot
Creating competitive products
inferredcites →https://doi.org/10.14778/1920841.1920890openalex-snapshot
Identifying the most influential data objects with reverse top-k queries
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

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-55190-2_63openalex-snapshot
RADAR: Fast Approximate Reverse Rank Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-11746-1_36openalex-snapshot
A Product-Customer Matching Framework for Web 2.0 Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-26154-6_22openalex-snapshot
A Unified Framework for Flexible Query Answering over Heterogeneous Data Sources
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_7openalex-snapshot
Discovering Influential Data Objects over Time
inferred← citeshttps://doi.org/10.1007/978-3-642-53917-6_31openalex-snapshot
Bichromatic Reverse Ranking Query in Two Dimensions
inferred← citeshttps://doi.org/10.1007/978-981-10-6635-1_1openalex-snapshot
Introduction to Preference Query Analysis and Optimization
inferred← citeshttps://doi.org/10.1007/s00778-016-0443-4openalex-snapshot
Answering why-not and why questions on reverse top-k queries
inferred← citeshttps://doi.org/10.1007/s00778-023-00804-1openalex-snapshot
Quantifying the competitiveness of a dataset in relation to general 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/s10115-018-1290-yopenalex-snapshot
Cost optimization based on influence and user preference
inferred← citeshttps://doi.org/10.1007/s10619-020-07297-9openalex-snapshot
Pruning techniques for parallel processing of reverse top-k queries
inferred← citeshttps://doi.org/10.1016/j.ins.2017.04.028openalex-snapshot
Reporting l most influential objects in uncertain databases based on probabilistic reverse top- k queries
inferred← citeshttps://doi.org/10.1016/j.ins.2018.05.010openalex-snapshot
An efficient method for the reverse top k search
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.1016/j.jcss.2016.05.010openalex-snapshot
Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data
inferred← citeshttps://doi.org/10.1109/cis.2014.68openalex-snapshot
Multi-user Preferences Based Top-k Query Processing Algorithm
inferred← citeshttps://doi.org/10.1109/dsaa.2014.7058118openalex-snapshot
User preference space partition and product filters for reverse top-k queries
inferred← citeshttps://doi.org/10.1109/icde.2016.7498283openalex-snapshot
Influence based cost optimization on user preference
inferred← citeshttps://doi.org/10.1109/icde.2019.00148openalex-snapshot
Parallel and Distributed Processing of Reverse Top-k Queries
inferred← citeshttps://doi.org/10.1109/tkde.2014.2324897openalex-snapshot
Best Keyword Cover Search
inferred← citeshttps://doi.org/10.1109/tkde.2015.2419659openalex-snapshot
On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization
inferred← citeshttps://doi.org/10.1145/2463676.2465278openalex-snapshot
Branch-and-bound algorithm for reverse top-k queries
inferred← citeshttps://doi.org/10.1145/2744680.2744686openalex-snapshot
Flexible Query Answering over Graph-modeled Data
inferred← citeshttps://doi.org/10.1145/2786006.2786012openalex-snapshot
Selecting Representative Objects Considering Coverage and Diversity
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/3448016.3452832openalex-snapshot
On m-Impact Regions and Standing Top-k Influence Problems
inferred← citeshttps://doi.org/10.1145/3448016.3457299openalex-snapshot
Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size
inferred← citeshttps://doi.org/10.1145/3514221.3526182openalex-snapshot
T-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space
inferred← citeshttps://doi.org/10.1145/3705726openalex-snapshot
Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output Size
inferred← citeshttps://doi.org/10.14778/2732951.2732952openalex-snapshot
Reverse k-ranks query
inferred← citeshttps://doi.org/10.14778/2752939.2752943openalex-snapshot
Answering why-not questions on reverse top- k queries
inferred← citeshttps://doi.org/10.14778/3339490.3339500openalex-snapshot
Creating top ranking options in the continuous option and preference space
inferred← citeshttps://doi.org/10.37394/23203.2024.19.31openalex-snapshot
Efficient Top-K Continuous Query Processing Over Sliding Window Model (SWM) Method on Uncertain Data Stream
inferred← citeshttps://doi.org/10.48084/etasr.7268openalex-snapshot
Securing Cloud Computing Services with an Intelligent Preventive Approach
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.19openalex-snapshot
Finding the Most Diverse Products using Preference Queries
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.