On the public citation graph
Semantics of Ranking Queries for Probabilistic Data
0 signed · 86 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.1007/978-0-387-09690-2_5openalex-snapshot
Trio A System for Data Uncertainty and Lineage
inferredcites →https://doi.org/10.1007/s00778-006-0004-3openalex-snapshot
Efficient query evaluation on probabilistic databases
inferredcites →https://doi.org/10.1007/s00778-007-0080-zopenalex-snapshot
Databases with uncertainty and lineage
inferredcites →https://doi.org/10.1007/s00778-011-0220-3openalex-snapshot
A unified approach to ranking in probabilistic databases
inferredcites →https://doi.org/10.1007/s10619-009-7050-yopenalex-snapshot
Semantics and evaluation of top-k queries in probabilistic databases
inferredcites →https://doi.org/10.1016/b978-012088469-8.50053-xopenalex-snapshot
Model-Driven Data Acquisition in Sensor Networks
inferredcites →https://doi.org/10.1016/b978-012088469-8/50053-xopenalex-snapshot
Model-Driven Data Acquisition in Sensor Networks1
inferredcites →https://doi.org/10.1023/a:1009761603038openalex-snapshot
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
inferredcites →https://doi.org/10.1109/icde.2006.174openalex-snapshot
Working Models for Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2007.367905openalex-snapshot
Representing and Querying Correlated Tuples in Probabilistic Databases
inferredcites →https://doi.org/10.1109/icde.2007.367906openalex-snapshot
10106Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
inferredcites →https://doi.org/10.1109/icde.2007.367907openalex-snapshot
Indexing Uncertain Categorical Data
inferredcites →https://doi.org/10.1109/icde.2007.367934openalex-snapshot
Efficient Top-k Query Evaluation on Probabilistic Data
inferredcites →https://doi.org/10.1109/icde.2007.367935openalex-snapshot
Top-k Query Processing in Uncertain Databases
inferredcites →https://doi.org/10.1109/icde.2007.367940openalex-snapshot
APLA: Indexing Arbitrary Probability Distributions
inferredcites →https://doi.org/10.1109/icde.2008.4497465openalex-snapshot
Top-k Spatial Joins of Probabilistic Objects
inferredcites →https://doi.org/10.1109/icde.2008.4497506openalex-snapshot
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2008.4497507openalex-snapshot
Fast and Simple Relational Processing of Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2008.4497525openalex-snapshot
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
inferredcites →https://doi.org/10.1109/icde.2008.4497570openalex-snapshot
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
inferredcites →https://doi.org/10.1109/icdew.2008.4498380openalex-snapshot
On the semantics and evaluation of top-k queries in probabilistic databases
inferredcites →https://doi.org/10.1109/tkde.2008.90openalex-snapshot
Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations
inferredcites →https://doi.org/10.1145/1189769.1189772openalex-snapshot
Adaptive rank-aware query optimization in relational databases
inferredcites →https://doi.org/10.1145/1247480.1247494openalex-snapshot
Progressive and selective merge
inferredcites →https://doi.org/10.1145/1353343.1353406openalex-snapshot
Probabilistic ranked queries in uncertain databases
inferredcites →https://doi.org/10.1145/1376616.1376685openalex-snapshot
Ranking queries on uncertain data
inferredcites →https://doi.org/10.1145/1376616.1376698openalex-snapshot
Finding frequent items in probabilistic data
inferredcites →https://doi.org/10.1145/1386118.1386119openalex-snapshot
Probabilistic top- k and ranking-aggregate queries
inferredcites →https://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferredcites →https://doi.org/10.1145/1557019.1557039openalex-snapshot
Probabilistic frequent itemset mining in uncertain databases
inferredcites →https://doi.org/10.1145/1559845.1559886openalex-snapshot
Top- k queries on uncertain data
inferredcites →https://doi.org/10.1145/371920.372165openalex-snapshot
Rank aggregation methods for the Web
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/872757.872796openalex-snapshot
Robust and efficient fuzzy match for online data cleaning
inferredcites →https://doi.org/10.1145/872757.872823openalex-snapshot
Evaluating probabilistic queries over imprecise data
inferredcites →https://doi.org/10.1214/aoms/1177728178openalex-snapshot
On the Distribution of the Number of Successes in Independent Trials
inferredcites →https://doi.org/10.14778/1453856.1453895openalex-snapshot
Efficient search for the top-k probable nearest neighbors in uncertain databases
inferredcites →https://doi.org/10.14778/1687627.1687685openalex-snapshot
A unified approach to ranking in probabilistic databases
inferredcites →https://doi.org/10.2140/pjm.1960.10.1181openalex-snapshot
An approximation theorem for the Poisson binomial distribution
inferredcites →https://doi.org/10.5555/1182635.1164130openalex-snapshot
Data integration: the teenage years
inferredcites →https://doi.org/10.5555/1182635.1164209openalex-snapshot
ULDBs: databases with uncertainty and lineage
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-18032-8_19openalex-snapshot
Mining Uncertain Sequential Patterns in Iterative MapReduce
inferred← citeshttps://doi.org/10.1007/978-3-319-18032-8_21openalex-snapshot
Towards Efficient Sequential Pattern Mining in Temporal Uncertain Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-31750-2_2openalex-snapshot
Distributed Sequential Pattern Mining in Large Scale Uncertain Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-48472-3_14openalex-snapshot
Top-k Queries Over Uncertain Scores
inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_6openalex-snapshot
A Truly Dynamic Data Structure for Top-k Queries on Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-642-38562-9_22openalex-snapshot
Top-K Aggregate Queries on Continuous Probabilistic Datasets
inferred← citeshttps://doi.org/10.1007/978-3-662-62199-8_2openalex-snapshot
Top-k Queries over Distributed Uncertain Categorical Data
inferred← citeshttps://doi.org/10.1007/s00500-014-1306-9openalex-snapshot
Ranking distributed database in tuple-level uncertainty
inferred← citeshttps://doi.org/10.1007/s10115-016-0977-1openalex-snapshot
Sequential pattern mining in databases with temporal uncertainty
inferred← citeshttps://doi.org/10.1007/s10619-014-7156-8openalex-snapshot
Efficient top-(k,l) range query processing for uncertain data based on multicore architectures
inferred← citeshttps://doi.org/10.1007/s10844-016-0403-xopenalex-snapshot
Efficient pruning for top-K ranking queries on attribute-wise uncertain datasets
inferred← citeshttps://doi.org/10.1016/j.datak.2014.05.001openalex-snapshot
A framework for ranking uncertain distributed database
inferred← citeshttps://doi.org/10.1016/j.fss.2017.07.012openalex-snapshot
Evaluating flexible criteria on uncertain data
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.004openalex-snapshot
Efficient processing of probabilistic set-containment queries on uncertain set-valued data
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.023openalex-snapshot
MUD: Mapping-based query processing for high-dimensional uncertain data
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.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/icces.2012.6408528openalex-snapshot
Ranking in uncertain distributed database environments
inferred← citeshttps://doi.org/10.1109/icde.2013.6544885openalex-snapshot
Similarity query processing for probabilistic sets
inferred← citeshttps://doi.org/10.1109/sled63792.2025.11154788openalex-snapshot
Priority Ranking Method for Electric Heavy-Duty Trucks in Inland Port Area Based on an AHP-CRITIC-Improved TOPSIS Model
inferred← citeshttps://doi.org/10.1109/tkde.2012.250openalex-snapshot
Consensus-Based Ranking of Multivalued Objects: A Generalized Borda Count Approach
inferred← citeshttps://doi.org/10.1145/2463664.2465219openalex-snapshot
Nearest neighbor searching under uncertainty II
inferred← citeshttps://doi.org/10.1145/2505515.2505735openalex-snapshot
Efficient pruning algorithm for top-K ranking on dataset with value uncertainty
inferred← citeshttps://doi.org/10.1145/2602135openalex-snapshot
Domination in the Probabilistic World
inferred← citeshttps://doi.org/10.1145/2955098openalex-snapshot
Nearest-Neighbor Searching Under Uncertainty II
inferred← citeshttps://doi.org/10.1145/3242095openalex-snapshot
Improving Classification Quality in Uncertain Graphs
inferred← citeshttps://doi.org/10.1145/3429523.3429533openalex-snapshot
Balanced Dominating Top-k Queries over Uncertain Data
inferred← citeshttps://doi.org/10.11591/ijece.v4i4.5920openalex-snapshot
Ranking in Distributed Uncertain Database Environments
inferred← citeshttps://doi.org/10.14257/ijgdc.2014.7.1.02openalex-snapshot
Credible Nearest Neighbor Query in Uncertain Network
inferred← citeshttps://doi.org/10.14778/2735461.2735463openalex-snapshot
Top-k nearest neighbor search in uncertain data series
inferred← citeshttps://doi.org/10.15168/11572_367934openalex-snapshot
Modeling and Querying Data Series and Data Streams with Uncertainty
inferred← citeshttps://doi.org/10.22028/d291-26567openalex-snapshot
Efficient querying and learning in probabilistic and temporal databases
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.785openalex-snapshot
Efficient Indexing for Structured and Unstructured Data
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2017.5openalex-snapshot
Top-k Querying of Unknown Values under Order Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4900openalex-snapshot
Query Interface Integrator For Domain Specific Hidden Web
inferred← citeshttps://doi.org/10.48550/arxiv.1405.5829openalex-snapshot
Node Classification in Uncertain Graphs
inferred← citeshttps://doi.org/10.5120/21345-4358openalex-snapshot
Top-k Query Processing Techniques in Uncertain Databases: A Review
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.