On the public citation graph
Time- and Space-Efficient Sliding Window Top-k Query Processing
0 signed · 60 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-71003-7openalex-snapshot
Stream Data Processing: A Quality of Service Perspective
inferredcites →https://doi.org/10.1007/s00778-009-0163-0openalex-snapshot
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
inferredcites →https://doi.org/10.1007/s00778-009-0171-0openalex-snapshot
Sliding-window top-k queries on uncertain streams
inferredcites →https://doi.org/10.1007/s11280-011-0125-5openalex-snapshot
Distributed processing of continuous sliding-window k-NN queries for data stream filtering
inferredcites →https://doi.org/10.1007/s11280-012-0191-3openalex-snapshot
Evaluating continuous top-k queries over document streams
inferredcites →https://doi.org/10.1016/b978-012088469-8.50071-1openalex-snapshot
Approximate NN Queries on Streams with Guaranteed Error/performance Bounds
inferredcites →https://doi.org/10.1109/allerton.2008.4797557openalex-snapshot
Recent results on processing random-order streams and space-efficient sampling
inferredcites →https://doi.org/10.1109/icde.2007.367861openalex-snapshot
Efficiently Processing Continuous k-NN Queries on Data Streams
inferredcites →https://doi.org/10.1109/icde.2009.197openalex-snapshot
An Incremental Threshold Method for Continuous Text Search Queries
inferredcites →https://doi.org/10.1109/sfcs.1978.32openalex-snapshot
Selection and sorting with limited storage
inferredcites →https://doi.org/10.1109/tkde.2007.190617openalex-snapshot
Continuous Nearest Neighbor Queries over Sliding Windows
inferredcites →https://doi.org/10.1109/tkde.2011.125openalex-snapshot
Efficient Evaluation of Continuous Text Search Queries
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1145/1061318.1061320openalex-snapshot
Progressive skyline computation in database systems
inferredcites →https://doi.org/10.1145/1142351.1142390openalex-snapshot
Approximate quantiles and the order of the stream
inferredcites →https://doi.org/10.1145/1142473.1142544openalex-snapshot
Continuous monitoring of top-k queries over sliding windows
inferredcites →https://doi.org/10.1145/1374376.1374470openalex-snapshot
Robust lower bounds for communication and stream computation
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/1645953.1646064openalex-snapshot
Evaluating top-k queries over incomplete data streams
inferredcites →https://doi.org/10.1145/1951365.1951375openalex-snapshot
An optimal strategy for monitoring top-k queries in streaming windows
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119397939.ch9openalex-snapshot
Anomaly Detection and Big Data in IPTV Networks
inferred← citeshttps://doi.org/10.1002/cpe.3866openalex-snapshot
Continuous skyline queries on multicore architectures
inferred← citeshttps://doi.org/10.1002/cpe.6009openalex-snapshot
An accurate and efficient two‐phase scheme for detecting Android cloned applications
inferred← citeshttps://doi.org/10.1007/978-3-030-73194-6_30openalex-snapshot
Time Period-Based Top-k Semantic Trajectory Pattern Query
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_1openalex-snapshot
Approximate Continuous Top-K Queries over Memory Limitation-Based Streaming Data
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_14openalex-snapshot
Efficient Regular Expression Matching on Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-981-13-2348-5_30openalex-snapshot
Assessing Scratch Programmers’ Development of Computational Thinking with Transaction-Level Data
inferred← citeshttps://doi.org/10.1007/978-981-15-6113-9_44openalex-snapshot
Finding the Most Reliable Maximum Flow in Transport Network
inferred← citeshttps://doi.org/10.1007/s00453-018-0524-4openalex-snapshot
Succinct Summing over Sliding Windows
inferred← citeshttps://doi.org/10.1007/s00500-018-3648-1openalex-snapshot
An empirical approach for probing the definiteness of kernels
inferred← citeshttps://doi.org/10.1007/s00778-016-0453-2openalex-snapshot
Top-k spatial-keyword publish/subscribe over sliding window
inferred← citeshttps://doi.org/10.1007/s00778-021-00661-wopenalex-snapshot
Location- and keyword-based querying of geo-textual data: a survey
inferred← citeshttps://doi.org/10.1007/s00778-024-00880-xopenalex-snapshot
SWOOP: top-k similarity joins over set streams
inferred← citeshttps://doi.org/10.1007/s11280-017-0518-1openalex-snapshot
ACRES: efficient query answering on large compressed sequences
inferred← citeshttps://doi.org/10.1007/s11390-017-1708-0openalex-snapshot
Approximate Continuous Top-k Query over Sliding Window
inferred← citeshttps://doi.org/10.1016/j.fss.2021.07.017openalex-snapshot
Effective and efficient aggregation on uncertain graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2020.02.029openalex-snapshot
Sliding-Window Probabilistic Threshold Aggregate Queries on Uncertain Data Streams
inferred← citeshttps://doi.org/10.1016/j.jnca.2015.06.023openalex-snapshot
Energy-aware and quality-driven sensor management for green mobile crowd sensing
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.06.150openalex-snapshot
Efficient index-independent approaches for the collective spatial keyword queries
inferred← citeshttps://doi.org/10.1038/s41467-021-24149-xopenalex-snapshot
Reconstruction of plant–pollinator networks from observational data
inferred← citeshttps://doi.org/10.1109/cac51589.2020.9327179openalex-snapshot
A Preliminary RSWKS Framework for Multiple Chang Points (MCPs) Detection on Pathological Signal Analysis in Partial Epilepsy
inferred← citeshttps://doi.org/10.1145/2675743.2772588openalex-snapshot
A high throughput processing engine for taxi-generated data streams
inferred← citeshttps://doi.org/10.14778/3685800.3685882openalex-snapshot
Catcher: A Cache Analysis System for Top- k Pub/Sub Service
inferred← citeshttps://doi.org/10.3233/ida-195071openalex-snapshot
A parametric approximation algorithm for spatial group keyword queries
inferred← citeshttps://doi.org/10.3233/sw-190367openalex-snapshot
Continuous top-k approximated join of streaming and evolving distributed data
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.3837/tiis.2018.12.015openalex-snapshot
EFTG: Efficient and Flexible Top-K Geo-textual Publish/Subscribe
inferred← citeshttps://doi.org/10.48550/arxiv.1708.02621openalex-snapshot
Real Time Analytics: Algorithms and Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02476openalex-snapshot
SWOOP: Top-k Similarity Joins over Set Streams
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.