On the public citation graph

Optimizing Multi-Top-k Queries over Uncertain Data Streams

0 signed · 49 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-3-031-01837-4openalex-snapshot
Data Stream Management
inferredcites →https://doi.org/10.1007/978-3-540-27811-5_3openalex-snapshot
Scheduling Strategies for Processing Continuous Queries over Streams
inferredcites →https://doi.org/10.1007/s00778-004-0132-6openalex-snapshot
Operator scheduling in data stream systems
inferredcites →https://doi.org/10.1007/s00778-004-0147-zopenalex-snapshot
The CQL continuous query language: semantic foundations and query execution
inferredcites →https://doi.org/10.1007/s10619-009-7043-xopenalex-snapshot
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
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.50032-2openalex-snapshot
Resource Sharing in Continuous Sliding-Window Aggregates
inferredcites →https://doi.org/10.1016/b978-012722442-8/50034-3openalex-snapshot
Scheduling for shared window joins over data streams
inferredcites →https://doi.org/10.1016/b978-012722442-8/50079-3openalex-snapshot
Operator Scheduling in a Data Stream Manager
inferredcites →https://doi.org/10.1109/icde.2007.367935openalex-snapshot
Top-k Query Processing in Uncertain Databases
inferredcites →https://doi.org/10.1109/icde.2008.4497423openalex-snapshot
A Framework for Clustering Uncertain Data Streams
inferredcites →https://doi.org/10.1109/icde.2009.75openalex-snapshot
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
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/real.1991.160378openalex-snapshot
Earliest deadline scheduling for real-time database systems
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.1137/1.9781611973075.109openalex-snapshot
Algorithms and Complexity for Periodic Real-Time Scheduling
inferredcites →https://doi.org/10.1145/1066157.1066192openalex-snapshot
Multiple aggregations over data streams
inferredcites →https://doi.org/10.1145/1142473.1142543openalex-snapshot
On-the-fly sharing for streamed aggregation
inferredcites →https://doi.org/10.1145/1183614.1183759openalex-snapshot
Multi-query optimization of sliding window aggregates by schedule synchronization
inferredcites →https://doi.org/10.1145/1247480.1247513openalex-snapshot
Sketching probabilistic data streams
inferredcites →https://doi.org/10.1145/1265530.1265565openalex-snapshot
Estimating statistical aggregates on probabilistic data streams
inferredcites →https://doi.org/10.1145/132271.132276openalex-snapshot
Scheduling real-time transactions
inferredcites →https://doi.org/10.1145/1376616.1376685openalex-snapshot
Ranking queries on uncertain data
inferredcites →https://doi.org/10.1145/42201.42203openalex-snapshot
Multiple-query optimization
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/543614.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564691.564698openalex-snapshot
Continuously adaptive continuous queries over streams
inferredcites →https://doi.org/10.1145/564696.564698openalex-snapshot
Continuously adaptive continuous queries over streams
inferredcites →https://doi.org/10.1145/776985.776986openalex-snapshot
Issues in data stream management
inferredcites →https://doi.org/10.14778/1453856.1453892openalex-snapshot
Sliding-window top-k queries on uncertain streams
inferredcites →https://doi.org/10.14778/1687627.1687685openalex-snapshot
A unified approach to ranking in probabilistic databases

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-11749-2_19openalex-snapshot
Continuous Monitoring of Top-k Dominating Queries over Uncertain Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-44270-9_12openalex-snapshot
Data Streams Processing Techniques
inferred← citeshttps://doi.org/10.1007/s10489-016-0789-8openalex-snapshot
An intelligent, uncertainty driven aggregation scheme for streams of ordered sets
inferred← citeshttps://doi.org/10.1007/s10586-017-1093-zopenalex-snapshot
Efficient data retrieval using adaptive clustered indexing for continuous queries over streaming data
inferred← citeshttps://doi.org/10.1016/j.datak.2018.09.004openalex-snapshot
Approximate top-K answering under uncertain schema mappings
inferred← citeshttps://doi.org/10.1016/j.ins.2015.03.035openalex-snapshot
A time optimized scheme for top-k list maintenance over incomplete data streams
inferred← citeshttps://doi.org/10.1049/cje.2015.04.025openalex-snapshot
Event‐Driven Top‐ k Queries in Sensor Networks with Multi Microenvironments
inferred← citeshttps://doi.org/10.1109/icces.2015.7393012openalex-snapshot
Multiple queries optimization for data streams on cloud computing
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00129openalex-snapshot
Multiple Continuous Top-K Queries Over Data Stream
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/tsmc.2017.2690364openalex-snapshot
Predictive Intelligence in Analytics Aggregation of Partial Ordered Subsets
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.21275/sr24417185232openalex-snapshot
Optimizing 5G Network Performance Through Periodic Measurement Report
inferred← citeshttps://doi.org/10.37394/23203.2021.16.22openalex-snapshot
A Method for Processing Top-k Continuous Query on Uncertain Data Stream in Sliding Window Model
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.4018/ijsi.312262openalex-snapshot
Deep Belief Neural Network (DBNN)-Based Categorization of Uncertain Data Streams
inferred← citeshttps://doi.org/10.4108/icst.collaboratecom.2014.257239openalex-snapshot
Towards Enabling Probabilistic Databases for Participatory Sensing
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.