On the public citation graph

Monochromatic and Bichromatic Reverse Top-k Queries

0 signed · 98 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/978-1-4020-9688-4_3openalex-snapshot
An analysis of several heuristics for the traveling salesman problem
inferredcites →https://doi.org/10.1109/icde.2001.914855openalex-snapshot
The Skyline operator
inferredcites →https://doi.org/10.1109/icde.2003.1260792openalex-snapshot
Efficient maintenance of materialized top-k views
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.2008.4497462openalex-snapshot
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
inferredcites →https://doi.org/10.1109/icde.2009.62openalex-snapshot
Reverse Furthest Neighbors in Spatial Databases
inferredcites →https://doi.org/10.1109/icde.2010.5447890openalex-snapshot
Reverse top-k queries
inferredcites →https://doi.org/10.1109/tkde.2004.30openalex-snapshot
Optimizing top-k selection queries over multimedia repositories
inferredcites →https://doi.org/10.1137/0206041openalex-snapshot
An Analysis of Several Heuristics for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/1005566.1005569openalex-snapshot
Evaluating top- k queries over web-accessible databases
inferredcites →https://doi.org/10.1145/1142473.1142547openalex-snapshot
DADA
inferredcites →https://doi.org/10.1145/1376616.1376641openalex-snapshot
Monochromatic and bichromatic reverse skyline search over uncertain databases
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/335191.335433openalex-snapshot
The onion technique
inferredcites →https://doi.org/10.1145/342009.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
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.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

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.4097openalex-snapshot
k‐nearest reliable neighbor search in crowdsourced LBSs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_80685openalex-snapshot
Reverse Top-k Queries
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-031-19211-1_39openalex-snapshot
QoS-oriented Hybrid Service Scheduling in Edge-Cloud Collaborated Clusters
inferred← citeshttps://doi.org/10.1007/978-3-031-47843-7_3openalex-snapshot
Probabilistic Reverse Top-k Query on Probabilistic Data
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_27openalex-snapshot
Probabilistic Reverse Top-k 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-21257-9_4openalex-snapshot
Categorizing Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-44406-2_8openalex-snapshot
Aggregate Reverse Rank Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_27openalex-snapshot
MinSum Based Optimal Location Query in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-96893-3_26openalex-snapshot
Reverse Top-k Query on Uncertain Preference
inferred← citeshttps://doi.org/10.1007/978-3-642-37487-6_17openalex-snapshot
Indexing Reverse Top-k Queries in Two Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_17openalex-snapshot
DART: An Efficient Method for Direction-Aware Bichromatic Reverse k Nearest Neighbor Queries
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-3-662-58384-5_1openalex-snapshot
Bound-and-Filter Framework for Aggregate Reverse Rank Queries
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/978-981-10-6635-1_3openalex-snapshot
Why-Not and Why Questions on Reverse Top-k Queries
inferred← citeshttps://doi.org/10.1007/978-981-95-6196-4_14openalex-snapshot
PPPR: Accelerating Probabilistic Reverse Top-k Queries via Clustering and Cluster-Aware Threshold Estimation
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-016-0445-2openalex-snapshot
Reverse k nearest neighbors queries and spatial reverse top-k queries
inferred← citeshttps://doi.org/10.1007/s00778-022-00759-9openalex-snapshot
Reverse spatial top-k keyword 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/s00778-026-00972-wopenalex-snapshot
A framework for top-k queries with constrained preferences
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/s10619-020-07297-9openalex-snapshot
Pruning techniques for parallel processing of reverse top-k queries
inferred← citeshttps://doi.org/10.1007/s10844-014-0326-3openalex-snapshot
DART+: Direction-aware bichromatic reverse k nearest neighbor query processing in spatial databases
inferred← citeshttps://doi.org/10.1007/s11280-016-0399-8openalex-snapshot
Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search
inferred← citeshttps://doi.org/10.1007/s11280-024-01293-0openalex-snapshot
Durable reverse top-k queries on time-varying preference
inferred← citeshttps://doi.org/10.1007/s11390-025-4764-xopenalex-snapshot
Durable Impact Period Queries on Time-Varying Preference
inferred← citeshttps://doi.org/10.1007/s11704-020-9279-6openalex-snapshot
Optimal location query based on k nearest neighbours
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.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/access.2023.3284904openalex-snapshot
A Rankable Boolean Searchable Encryption Scheme Supporting Dynamic Updates in a Cloud Environment
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.2019.00148openalex-snapshot
Parallel and Distributed Processing of Reverse Top-k Queries
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00314openalex-snapshot
Reverse Regret Query
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00287openalex-snapshot
Synthesizing Scoring Functions for Rankings Using Symbolic Gradient Descent
inferred← citeshttps://doi.org/10.1109/mdm.2016.79openalex-snapshot
Geometric Aspects and Auxiliary Features to Top-k Processing
inferred← citeshttps://doi.org/10.1109/mdm.2019.00-71openalex-snapshot
KOLQ in a Road Network
inferred← citeshttps://doi.org/10.1109/mdm.2019.00-81openalex-snapshot
Geometric Top-k Processing: Updates Since MDM'16 [Advanced Seminar]
inferred← citeshttps://doi.org/10.1109/pic.2017.8359553openalex-snapshot
Maximizing bichromatic reverse k nearest neighbor with multi-level tags queries in spatial-textual databases
inferred← citeshttps://doi.org/10.1109/tcyb.2025.3531441openalex-snapshot
Co-Training Broad Siamese-Like Network for Coupled-View Semi-Supervised Learning
inferred← citeshttps://doi.org/10.1109/tkde.2012.34openalex-snapshot
Efficient All Top-k Computation - A Unified Solution for All Top-k, Reverse Top-k and Top-m Influential 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.2436933openalex-snapshot
Reverse Keyword Search for Spatio-Textual Top- $k$ Queries in Location-Based Services
inferred← citeshttps://doi.org/10.1109/tkde.2018.2802936openalex-snapshot
Querying a Collection of Continuous Functions
inferred← citeshttps://doi.org/10.1145/2213836.2213882openalex-snapshot
Processing a large number of continuous preference top- k queries
inferred← citeshttps://doi.org/10.1145/2463676.2465278openalex-snapshot
Branch-and-bound algorithm for reverse top-k queries
inferred← citeshttps://doi.org/10.1145/2588555.2610508openalex-snapshot
Global immutable region computation
inferred← citeshttps://doi.org/10.1145/3035918.3064044openalex-snapshot
Determining the Impact Regions of Competing Options in Preference Space
inferred← citeshttps://doi.org/10.1145/3132847.3133040openalex-snapshot
Learning to Un-Rank
inferred← citeshttps://doi.org/10.1145/3225216openalex-snapshot
Weighted Aggregate Reverse Rank Queries
inferred← citeshttps://doi.org/10.1145/3460231.3474229openalex-snapshot
Reverse Maximum Inner Product Search: How to efficiently find users who would like to buy my item?
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/3587215openalex-snapshot
Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis
inferred← citeshttps://doi.org/10.1145/3595384openalex-snapshot
Who Will Purchase This Item Next? Reverse Next Period Recommendation in Grocery Shopping
inferred← citeshttps://doi.org/10.1145/3733723.3733724openalex-snapshot
How to Mine Potentially Popular Items? A Reverse MIPS-based Approach
inferred← citeshttps://doi.org/10.14257/ijdta.2016.9.3.18openalex-snapshot
Top-k Algorithm for User Preferences based on Selection Strategy
inferred← citeshttps://doi.org/10.14778/2732269.2732275openalex-snapshot
Computing k-regret minimizing sets
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/2824032.2824053openalex-snapshot
Maximum rank query
inferred← citeshttps://doi.org/10.14778/2904121.2904122openalex-snapshot
Maximizing bichromatic reverse spatial and textual k nearest neighbor queries
inferred← citeshttps://doi.org/10.14778/3137765.3137826openalex-snapshot
Geometric approaches for top-k queries
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/3339490.3339500openalex-snapshot
Creating top ranking options in the continuous option and preference space
inferred← citeshttps://doi.org/10.14778/3598581.3598606openalex-snapshot
Why Not Yet: Fixing a Top-k Ranking that is Not Fair to Individuals
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25550openalex-snapshot
SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search
inferred← citeshttps://doi.org/10.31274/td-20240329-269openalex-snapshot
Efficient feasibility checking algorithms for intersection-tree construction
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0837openalex-snapshot
Indexing Reverse Top-k Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6329openalex-snapshot
Computing optimal k-regret minimizing sets with top-k depth contours
inferred← citeshttps://doi.org/10.5353/th_b4697391openalex-snapshot
Scalable skyline evaluation in multidimensional and partially ordered domains
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.19openalex-snapshot
Finding the Most Diverse Products using Preference Queries
inferred← citeshttps://doi.org/10.5441/002/edbt.2017.27openalex-snapshot
Querying Improvement Strategies
inferred← citeshttps://doi.org/10.5441/002/edbt.2017.28openalex-snapshot
Grid-Index Algorithm for Reverse Rank 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.