On the public citation graph
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
0 signed · 62 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.1006/jcss.1998.1600openalex-snapshot
Combining Fuzzy Information from Multiple Systems
inferredcites →https://doi.org/10.1007/s00778-003-0099-8openalex-snapshot
Algorithms and applications for answering ranked queries using ranked views
inferredcites →https://doi.org/10.1016/0306-4573(90)90016-uopenalex-snapshot
Automatic text processing
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/s0022-0000(03)00026-6openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1109/coopis.1999.792176openalex-snapshot
Using Fagin's algorithm for merging ranked results in multimedia middleware
inferredcites →https://doi.org/10.1109/icde.1999.754894openalex-snapshot
Query processing issues in image (multimedia) databases
inferredcites →https://doi.org/10.1109/icde.2002.994751openalex-snapshot
Evaluating top-k queries over Web-accessible databases
inferredcites →https://doi.org/10.1109/icde.2005.102openalex-snapshot
Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach
inferredcites →https://doi.org/10.1109/tkde.2004.30openalex-snapshot
Optimizing top-k selection queries over multimedia repositories
inferredcites →https://doi.org/10.1109/tkde.2007.1007openalex-snapshot
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
inferredcites →https://doi.org/10.1145/1005566.1005569openalex-snapshot
Evaluating top- k queries over web-accessible databases
inferredcites →https://doi.org/10.1145/1011767.1011798openalex-snapshot
Efficient top-K query calculation in distributed networks
inferredcites →https://doi.org/10.1145/191839.191906openalex-snapshot
Optimizing disjunctive queries with expensive predicates
inferredcites →https://doi.org/10.1145/191843.191906openalex-snapshot
Optimizing disjunctive queries with expensive predicates
inferredcites →https://doi.org/10.1145/233269.233323openalex-snapshot
Optimizing queries over multimedia repositories
inferredcites →https://doi.org/10.1145/235968.233323openalex-snapshot
Optimizing queries over multimedia repositories
inferredcites →https://doi.org/10.1145/237661.237715openalex-snapshot
Combining fuzzy information from multiple systems (extended abstract)
inferredcites →https://doi.org/10.1145/335191.335423openalex-snapshot
A framework for expressing and combining preferences
inferredcites →https://doi.org/10.1145/342009.335423openalex-snapshot
A framework for expressing and combining preferences
inferredcites →https://doi.org/10.1145/568518.568519openalex-snapshot
Top- k selection queries over relational databases
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
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-642-34213-4_10openalex-snapshot
Extending SPARQL Algebra to Support Efficient Evaluation of Top-K SPARQL Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-35176-1_22openalex-snapshot
Efficient Execution of Top-K SPARQL Queries
inferred← citeshttps://doi.org/10.1007/s10844-009-0078-7openalex-snapshot
Processing top-N relational queries by learning
inferred← citeshttps://doi.org/10.1016/j.datak.2020.101833openalex-snapshot
PRESS: A personalised approach for mining top-k groups of objects with subspace similarity
inferred← citeshttps://doi.org/10.1016/j.future.2020.06.052openalex-snapshot
Top- k query optimization over data services
inferred← citeshttps://doi.org/10.1016/j.ins.2012.08.013openalex-snapshot
TJJE: An efficient algorithm for top-k join on massive data
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.03.003openalex-snapshot
Supporting early pruning in top-k query processing on massive data
inferred← citeshttps://doi.org/10.1109/icde.2006.54openalex-snapshot
Efficient Aggregation of Ranked Inputs
inferred← citeshttps://doi.org/10.1109/icde.2008.4497518openalex-snapshot
P-Cube: Answering Preference Queries in Multi-Dimensional Space
inferred← citeshttps://doi.org/10.1109/icde.2009.109openalex-snapshot
Best-Effort Top-k Query Processing Under Budgetary Constraints
inferred← citeshttps://doi.org/10.1109/icde.2009.112openalex-snapshot
Leveraging COUNT Information in Sampling Hidden Databases
inferred← citeshttps://doi.org/10.1109/icde.2012.73openalex-snapshot
Efficient Dual-Resolution Layer Indexing for Top-k Queries
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498383openalex-snapshot
Skyline ranking for uncertain data with maybe confidence
inferred← citeshttps://doi.org/10.1109/icmit47780.2020.9046996openalex-snapshot
Ranking queries optimization over external data sources
inferred← citeshttps://doi.org/10.1109/icnp.2011.6089087openalex-snapshot
Efficient and fast distributed top-k query protocol in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icsmc.2006.385077openalex-snapshot
Towards Top-k Query Answering in Deductive Databases
inferred← citeshttps://doi.org/10.1109/tkde.2004.30openalex-snapshot
Optimizing top-k selection queries over multimedia repositories
inferred← citeshttps://doi.org/10.1109/tkde.2007.1011openalex-snapshot
The Threshold Algorithm: From Middleware Systems to the Relational Engine
inferred← citeshttps://doi.org/10.1109/tkde.2007.47openalex-snapshot
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
inferred← citeshttps://doi.org/10.1109/tkde.2011.161openalex-snapshot
Cost-Aware Rank Join with Random and Sorted Access
inferred← citeshttps://doi.org/10.1109/waim.2008.59openalex-snapshot
Approximate Boolean + Ranking Query Answering Using Wavelets
inferred← citeshttps://doi.org/10.1109/waim.2008.88openalex-snapshot
PerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes
inferred← citeshttps://doi.org/10.1145/1391729.1391730openalex-snapshot
A survey of top- k query processing techniques in relational database systems
inferred← citeshttps://doi.org/10.1145/3331184.3331404openalex-snapshot
Explanatory and Actionable Debugging for Machine Learning
inferred← citeshttps://doi.org/10.14778/1453856.1453934openalex-snapshot
Efficient network aware search in collaborative tagging sites
inferred← citeshttps://doi.org/10.18653/v1/d19-1262openalex-snapshot
NL2pSQL: Generating Pseudo-SQL Queries from Under-Specified Natural Language Questions
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.01405openalex-snapshot
TKEP: An Efficient Top-K Query Processing Algorithm on Massive Data
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.00872openalex-snapshot
Method of Top-k Web service selection based on QoS
inferred← citeshttps://doi.org/10.4018/ijwsr.2020100101openalex-snapshot
Towards Rank-Aware Data Mashups
inferred← citeshttps://doi.org/10.4304/jcp.9.9.2013-2021openalex-snapshot
A Fast Searching Approach for Top-k Partner Selection in Dynamic Alliances of Virtual Enterprises
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5057openalex-snapshot
Approximate Top-k Retrieval from Hidden Relations
showing the first 33 of 34 · page through all 34
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.