On the public citation graph
Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations
0 signed · 128 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-009-0149-yopenalex-snapshot
$${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information
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.50076-0openalex-snapshot
Efficient Query evaluation on Probabilistic Databases
inferredcites →https://doi.org/10.1016/b978-012088469-8/50053-xopenalex-snapshot
Model-Driven Data Acquisition in Sensor Networks1
inferredcites →https://doi.org/10.1016/b978-012088469-8/50076-0openalex-snapshot
Efficient Query evaluation on Probabilistic Databases
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/69.166990openalex-snapshot
The management of probabilistic data
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.4497571openalex-snapshot
Efficient Processing of Top-k Queries in Uncertain Databases
inferredcites →https://doi.org/10.1145/1247480.1247559openalex-snapshot
From complete to incomplete information and back
inferredcites →https://doi.org/10.1145/1376616.1376685openalex-snapshot
Ranking queries on uncertain data
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/38713.38724openalex-snapshot
On the representation and querying of sets of possible worlds
inferredcites →https://doi.org/10.1145/38714.38724openalex-snapshot
On the representation and querying of sets of possible worlds
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.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-030-55462-0_14openalex-snapshot
Uncertain Spatial Data Management: An Overview
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-02279-1_31openalex-snapshot
Probabilistic Similarity Search for Uncertain Time Series
inferred← citeshttps://doi.org/10.1007/978-3-642-15364-8_12openalex-snapshot
Efficient Fuzzy Top-k Query Processing over Uncertain Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-20149-3_38openalex-snapshot
A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML
inferred← citeshttps://doi.org/10.1007/978-3-642-22351-8_3openalex-snapshot
Continuous Inverse Ranking Queries in Uncertain Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-29035-0_1openalex-snapshot
Top-k Best Probability Queries on Probabilistic Data
inferred← citeshttps://doi.org/10.1007/978-3-642-29219-4_20openalex-snapshot
Efficient Probabilistic Query Ranking in Uncertain Databases
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-642-40769-7_44openalex-snapshot
On Top-k Retrieval for a Family of Non-monotonic Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-81-322-2517-1_48openalex-snapshot
Entity Resolution-Based Jaccard Similarity Coefficient for Heterogeneous Distributed Databases
inferred← citeshttps://doi.org/10.1007/978-981-16-7566-9_5openalex-snapshot
Top-k Probabilistically Prevalent Co-location Patterns
inferred← citeshttps://doi.org/10.1007/s00500-014-1306-9openalex-snapshot
Ranking distributed database in tuple-level uncertainty
inferred← citeshttps://doi.org/10.1007/s00778-008-0127-9openalex-snapshot
Anytime measures for top-k algorithms on exact and fuzzy data sets
inferred← citeshttps://doi.org/10.1007/s00778-009-0162-1openalex-snapshot
Threshold-based probabilistic top-k dominating queries
inferred← citeshttps://doi.org/10.1007/s00778-009-0174-xopenalex-snapshot
Efficient processing of exact top-k queries over disk-resident sorted lists
inferred← citeshttps://doi.org/10.1007/s00778-010-0196-4openalex-snapshot
Ranking queries on uncertain data
inferred← citeshttps://doi.org/10.1007/s00779-012-0542-1openalex-snapshot
Top-k entities query processing on uncertainly fused multi-sensory data
inferred← citeshttps://doi.org/10.1007/s10115-013-0638-6openalex-snapshot
A survey of queries over uncertain data
inferred← citeshttps://doi.org/10.1007/s10489-011-0312-1openalex-snapshot
Efficient fuzzy ranking queries in uncertain databases
inferred← citeshttps://doi.org/10.1007/s10619-013-7129-3openalex-snapshot
Entity resolution for distributed probabilistic data
inferred← citeshttps://doi.org/10.1007/s10619-015-7188-8openalex-snapshot
Uncertain top-k query processing in distributed environments
inferred← citeshttps://doi.org/10.1007/s10707-017-0297-yopenalex-snapshot
Combined geo-social search: computing top-k join queries over incomplete information
inferred← citeshttps://doi.org/10.1007/s11280-011-0144-2openalex-snapshot
Efficient processing of top-k twig queries over probabilistic XML data
inferred← citeshttps://doi.org/10.1007/s11390-010-9336-yopenalex-snapshot
Context-Sensitive Document Ranking
inferred← citeshttps://doi.org/10.1007/s11704-015-4196-9openalex-snapshot
Top-k probabilistic prevalent co-location mining in spatially uncertain data sets
inferred← citeshttps://doi.org/10.1007/s11704-017-7063-zopenalex-snapshot
A survey of uncertain data management
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.07.047openalex-snapshot
On the semantics of top- k ranking for objects with uncertain data
inferred← citeshttps://doi.org/10.1016/j.datak.2013.04.005openalex-snapshot
Top-k best probability queries and semantics ranking properties on probabilistic databases
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.ins.2010.11.001openalex-snapshot
Combining intensional with extensional query evaluation in tuple independent probabilistic databases
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.135openalex-snapshot
Entity resolution for probabilistic data
inferred← citeshttps://doi.org/10.1016/j.ins.2014.08.065openalex-snapshot
Trustworthy answers for top-k queries on uncertain Big Data in decision making
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.016openalex-snapshot
A dynamic data structure for top-k queries on uncertain data
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364018openalex-snapshot
Top (k1, k2) Distance-based outliers detection in an uncertain dataset
inferred← citeshttps://doi.org/10.1109/ccdc.2013.6561499openalex-snapshot
Optimizing distributed Top-k queries on uncertain data
inferred← citeshttps://doi.org/10.1109/cicn.2012.107openalex-snapshot
Efficient Processing of Probabilistic Threshold Top-k Queries Based on X-tuple in Uncertain Database
inferred← citeshttps://doi.org/10.1109/cit.2010.130openalex-snapshot
Two Novel Semantics of Top-k Queries Processing in Uncertain Database
inferred← citeshttps://doi.org/10.1109/cyber.2013.6705453openalex-snapshot
Determining the minimum scan scope of UTop-k queries in uncertain databases
inferred← citeshttps://doi.org/10.1109/fskd.2010.5569645openalex-snapshot
Top-k ranking for uncertain data
inferred← citeshttps://doi.org/10.1109/his.2009.156openalex-snapshot
Frequent Items Computation over Uncertain Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/iccsnt.2012.6526356openalex-snapshot
A keyword query method for uncertain database
inferred← citeshttps://doi.org/10.1109/icde.2009.75openalex-snapshot
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
inferred← citeshttps://doi.org/10.1109/icde.2013.6544820openalex-snapshot
Cleaning uncertain data for top-k queries
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00367openalex-snapshot
Space-Efficient Indexes for Uncertain Strings
inferred← citeshttps://doi.org/10.1109/icdm.2013.150openalex-snapshot
Mining Probabilistic Frequent Spatio-Temporal Sequential Patterns with Gap Constraints from Uncertain Databases
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5365178openalex-snapshot
Efficient Processing of Global Top-k Aggregate Queries in Uncertain Database
inferred← citeshttps://doi.org/10.1109/icmla.2012.57openalex-snapshot
An Efficient Algorithm for top-k Queries on Uncertain Data Streams
inferred← citeshttps://doi.org/10.1109/paap.2011.46openalex-snapshot
Top-k Queries Processing with Uncertain Data on Graphics Processing Units
inferred← citeshttps://doi.org/10.1109/smc.2015.462openalex-snapshot
Verification of Top-K Algorithm for a Family of Non-monotonic Ranking Functions
inferred← citeshttps://doi.org/10.1109/tie.2014.2334653openalex-snapshot
Insights of Top- $k$ Query in Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tkde.2009.112openalex-snapshot
Ranked Query Processing in Uncertain Databases
inferred← citeshttps://doi.org/10.1109/tkde.2010.192openalex-snapshot
Semantics of Ranking Queries for Probabilistic Data
inferred← citeshttps://doi.org/10.1109/tkde.2010.215openalex-snapshot
Learning Bregman Distance Functions for Semi-Supervised Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2010.217openalex-snapshot
Semantics of Ranking Queries for Probabilistic Data
inferred← citeshttps://doi.org/10.1109/tkde.2010.78openalex-snapshot
Scalable Probabilistic Similarity Ranking in Uncertain Databases
inferred← citeshttps://doi.org/10.1109/tkde.2011.121openalex-snapshot
Discovering the Most Influential Sites over Uncertain Data: A Rank-Based Approach
inferred← citeshttps://doi.org/10.1109/tkde.2011.145openalex-snapshot
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tkde.2011.243openalex-snapshot
Clustering Large Probabilistic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2012.102openalex-snapshot
The Skyline of a Probabilistic Relation
inferred← citeshttps://doi.org/10.1109/tkde.2012.126openalex-snapshot
Optimizing Multi-Top-k Queries over Uncertain Data Streams
inferred← citeshttps://doi.org/10.1109/tkde.2012.179openalex-snapshot
Dealing with Uncertainty: A Survey of Theories and Practices
inferred← citeshttps://doi.org/10.1109/tkde.2019.2897557openalex-snapshot
Efficient Process Conformance Checking on the Basis of Uncertain Event-to-Activity Mappings
inferred← citeshttps://doi.org/10.1109/waina.2010.183openalex-snapshot
Global Top-k Aggregate Queries Based on X-tuple in Uncertain Database
inferred← citeshttps://doi.org/10.1109/wisa.2015.23openalex-snapshot
Research on the Semantic of Entity-Oriented U-Topk Query and Its Processing
inferred← citeshttps://doi.org/10.1137/1.9781611973440.88openalex-snapshot
Efficient Matching of Substrings in Uncertain Sequences
inferred← citeshttps://doi.org/10.1145/1516360.1516380openalex-snapshot
Query ranking in probabilistic XML data
inferred← citeshttps://doi.org/10.1145/1559845.1559886openalex-snapshot
Top- k queries on uncertain data
inferred← citeshttps://doi.org/10.1145/1645953.1646164openalex-snapshot
Context-sensitive document ranking
inferred← citeshttps://doi.org/10.1145/1739041.1739099openalex-snapshot
Probabilistic ranking over relations
inferred← citeshttps://doi.org/10.1145/2602135openalex-snapshot
Domination in the Probabilistic World
inferred← citeshttps://doi.org/10.1145/3340964.3340974openalex-snapshot
Representative Query Answers on Uncertain Data
inferred← citeshttps://doi.org/10.1145/3377330.3377332openalex-snapshot
A Guide to Designing Top-k Indexes
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/3546074openalex-snapshot
Generic Techniques for Building Top- k Structures
inferred← citeshttps://doi.org/10.1145/3617291.3617300openalex-snapshot
Probabilistic Counting in Uncertain Spatial Databases Using Generating Functions
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.1145/3709655openalex-snapshot
A Rank-Based Approach to Recommender System's Top-K Queries with Uncertain Scores
inferred← citeshttps://doi.org/10.1155/2015/359137openalex-snapshot
MSSUTop- k : Determining the Minimum Scan Scope for UTop- k Query over Uncertain Data
inferred← citeshttps://doi.org/10.14778/1920841.1920967openalex-snapshot
k-nearest neighbors in uncertain graphs
inferred← citeshttps://doi.org/10.14778/2021017.2021018openalex-snapshot
On pruning for top-k ranking in uncertain databases
inferred← citeshttps://doi.org/10.14778/3565816.3565834openalex-snapshot
Approximating probabilistic group steiner trees in graphs
inferred← citeshttps://doi.org/10.1587/transinf.2015edl8077openalex-snapshot
Top (k1,k2) Query in Uncertain Datasets
inferred← citeshttps://doi.org/10.2200/s00465ed1v01y201212dtm033openalex-snapshot
Query Processing over Uncertain Databases
inferred← citeshttps://doi.org/10.26190/unsworks/14926openalex-snapshot
Efficiently and effectively processing probabilistic queries on uncertain data
inferred← citeshttps://doi.org/10.3233/fi-2014-1042openalex-snapshot
A Decomposition Framework for Computing and Querying Multidimensional OLAP Data Cubes over Probabilistic Relational Data
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.02605openalex-snapshot
Probabilistic top-k and ranking query algorithms in uncertain databases
inferred← citeshttps://doi.org/10.3724/sp.j.1187.2010.00650openalex-snapshot
Top-k query processing on probabilistic data
inferred← citeshttps://doi.org/10.4230/dagsemproc.08421.11openalex-snapshot
Recommendation: A Less Explored Killer-App of Uncertainty?
inferred← citeshttps://doi.org/10.48550/arxiv.0906.4927openalex-snapshot
Fast Probabilistic Ranking under x-Relation Model
inferred← citeshttps://doi.org/10.48550/arxiv.0907.2868openalex-snapshot
Scalable Probabilistic Similarity Ranking in Uncertain Databases (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2003.00773openalex-snapshot
Top-K Deep Video Analytics: A Probabilistic Approach
inferred← citeshttps://doi.org/10.5539/cis.v8n3p119openalex-snapshot
Handling Uncertainty in Database: An Introduction and Brief Survey
inferred← citeshttps://doi.org/10.6688/jise.2015.31.1.10openalex-snapshot
Novel Semantics of the Top-k Queries on Uncertainly Fused Multi-Sensory Data
inferred← citeshttps://doi.org/10.9790/0661-16184853openalex-snapshot
Distributed Processing of Probabilistic Top-kQueries with Efficient Query Evaluation
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.