On the public citation graph

Efficient Processing of Distributed Top-k Queries

0 signed · 59 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.1006/jcss.1998.1600openalex-snapshot
Combining Fuzzy Information from Multiple Systems
inferredcites →https://doi.org/10.1007/s00778-004-0128-2openalex-snapshot
Supporting top-k join queries in relational databases
inferredcites →https://doi.org/10.1016/b978-012088469-8.50058-9openalex-snapshot
Top-k Query Evaluation with Probabilistic Guarantees
inferredcites →https://doi.org/10.1016/b978-012722442-8/50072-0openalex-snapshot
Supporting Top-k Join Queries in Relational Databases
inferredcites →https://doi.org/10.1109/icde.1999.754894openalex-snapshot
Query processing issues in image (multimedia) databases
inferredcites →https://doi.org/10.1109/icde.2003.1260792openalex-snapshot
Efficient maintenance of materialized top-k views
inferredcites →https://doi.org/10.1109/icde.2003.1260799openalex-snapshot
Ranked join indices
inferredcites →https://doi.org/10.1109/icde.2005.115openalex-snapshot
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1145/1007568.1007593openalex-snapshot
Rank-aware query optimization
inferredcites →https://doi.org/10.1145/1011767.1011798openalex-snapshot
Efficient top-K query calculation in distributed networks
inferredcites →https://doi.org/10.1145/233269.233342openalex-snapshot
Improved histograms for selectivity estimation of range predicates
inferredcites →https://doi.org/10.1145/237661.237715openalex-snapshot
Combining fuzzy information from multiple systems (extended abstract)
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/568518.568519openalex-snapshot
Top- k selection queries over relational databases
inferredcites →https://doi.org/10.1145/872757.872764openalex-snapshot
Distributed top-k monitoring
inferredcites →https://doi.org/10.2307/409735openalex-snapshot
Human behavior and the principle of least effort: An introduction to human ecology. By George Kingsley Zipf. Pp. xi, 573. Cambridge, Mass.: Addison-Wesley Press, 1949.

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-540-70504-8_12openalex-snapshot
Smooth Interpolating Histograms with Error Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-540-85481-4_26openalex-snapshot
Optimizing Distributed Top-k Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-17226-7_12openalex-snapshot
Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_35openalex-snapshot
Probabilistic Optimization of Top-k Aggregation in Distributed Environments
inferred← citeshttps://doi.org/10.1007/s00450-007-0024-2openalex-snapshot
Algebraic query optimization for distributed top-k queries
inferred← citeshttps://doi.org/10.1007/s00500-014-1306-9openalex-snapshot
Ranking distributed database in tuple-level uncertainty
inferred← citeshttps://doi.org/10.1007/s00607-026-01724-yopenalex-snapshot
Fast and accurate distributed top-k aggregation
inferred← citeshttps://doi.org/10.1007/s10619-009-7041-zopenalex-snapshot
Distributed top-k aggregation queries at large
inferred← citeshttps://doi.org/10.1007/s10619-010-7072-5openalex-snapshot
Power efficiency through tuple ranking in wireless sensor network monitoring
inferred← citeshttps://doi.org/10.1007/s11280-011-0125-5openalex-snapshot
Distributed processing of continuous sliding-window k-NN queries for data stream filtering
inferred← citeshttps://doi.org/10.1007/s11280-019-00741-6openalex-snapshot
Distributed and parallel processing for real-time and dynamic spatio-temporal graph
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.01.008openalex-snapshot
Finding the K highest-ranked answers in a distributed network
inferred← citeshttps://doi.org/10.1016/j.datak.2007.03.012openalex-snapshot
Efficient top-k processing in large-scaled distributed environments
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.jpdc.2010.09.002openalex-snapshot
Top- k vectorial aggregation queries in a distributed environment
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364013openalex-snapshot
Scalable preference queries for high-dimensional data using map-reduce
inferred← citeshttps://doi.org/10.1109/ccis.2012.6664281openalex-snapshot
Algorithm for distributed traffic traces AGGREGATION based on SMC
inferred← citeshttps://doi.org/10.1109/cise.2009.5365791openalex-snapshot
Distributed Top-k Complex Event Processing for RFID Application
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00194openalex-snapshot
Real-Time Trajectory Similarity Processing Using Longest Common Subsequence
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6014671openalex-snapshot
High-performance top-k complex event detection from RFID event stream
inferred← citeshttps://doi.org/10.1109/icde.2009.54openalex-snapshot
KSpot: Effectively Monitoring the K Most Important Events in a Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/icde.2012.58openalex-snapshot
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
inferred← citeshttps://doi.org/10.1109/icndc.2010.82openalex-snapshot
Best Position Algorithms for Top-k Query Processing in Highly Distributed Environments
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195789openalex-snapshot
Location Aware Peak Value Queries in sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566936openalex-snapshot
Pegasus: Precision hunting for icebergs and anomalies in network flows
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625647openalex-snapshot
MOTE: Efficient monitoring of top-k set in sensor networks
inferred← citeshttps://doi.org/10.1109/mdm.2007.34openalex-snapshot
MINT Views: Materialized In-Network Top-k Views in Sensor Networks
inferred← citeshttps://doi.org/10.1109/socialcom-passat.2012.103openalex-snapshot
Authenticated Top-K Aggregation in Distributed and Outsourced Databases
inferred← citeshttps://doi.org/10.1109/tkde.2008.142openalex-snapshot
Distributed Skyline Retrieval with Low Bandwidth Consumption
inferred← citeshttps://doi.org/10.1109/tnse.2023.3309250openalex-snapshot
Differentially Private Top-$k$ Flows Estimation Mechanism in Network Traffic
inferred← citeshttps://doi.org/10.1109/tpds.2012.69openalex-snapshot
A General Framework for Efficient Continuous Multidimensional Top-k Query Processing in Sensor Networks
inferred← citeshttps://doi.org/10.1145/1183614.1183621openalex-snapshot
Distributed spatio-temporal similarity search
inferred← citeshttps://doi.org/10.1145/1871437.1871607openalex-snapshot
Evaluation of top-k queries in peer-to-peer networks using threshold algorithms
inferred← citeshttps://doi.org/10.1145/2938503.2938525openalex-snapshot
A Two-Phase MapReduce Algorithm for Scalable Preference Queries over High-Dimensional Data
inferred← citeshttps://doi.org/10.11591/ijece.v4i4.5920openalex-snapshot
Ranking in Distributed Uncertain Database Environments
inferred← citeshttps://doi.org/10.14778/1921071.1921072openalex-snapshot
Distributed threshold querying of general functions by a difference of monotonic representation
inferred← citeshttps://doi.org/10.1587/transinf.2015edp7377openalex-snapshot
Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
inferred← citeshttps://doi.org/10.18297/etd/470openalex-snapshot
Monitoring frequent items over distributed data streams.
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4686001/v1openalex-snapshot
Information retrieval in P2P systems
inferred← citeshttps://doi.org/10.23919/mipro.2018.8400257openalex-snapshot
NoSQL approach for sensor data storage and retrieval
inferred← citeshttps://doi.org/10.5555/1182635.1164169openalex-snapshot
IO-Top-k: index-access optimized top-k query processing
inferred← citeshttps://doi.org/10.70675/183a5d5fzf135z4157z9308z6fb6d6ab141aopenalex-snapshot
Privacy preserving top-k query processing over outsourced data
inferred← citeshttps://doi.org/10.9781/ijimai.2019.04.002openalex-snapshot
MWAND: A New Early Termination Algorithm for Fast and 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.