Building Ranked Mashups of Unstructured Sources with Uncertain Information
Summary: MashRank: a system for ranked mashups from unstructured sources with uncertain, interval-valued preferences. Novel semantics for uncertain scores; asynchronous extraction feeds a pipelined, rank-aware plan with early-out to curb costs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Mohamed A. Soliman (University of Waterloo)
- 2. Ihab F. Ilyas (University of Waterloo)
- 3. Mina Saleeb (University of Waterloo)
BibTeX Citation
@article{soliman_vldb10,
title = {{Building Ranked Mashups of Unstructured Sources with Uncertain Information}},
author = {Soliman, Mohamed A. and Ilyas, Ihab F. and Saleeb, Mina},
journal = {PVLDB},
series = {{VLDB} '10},
volume = {3},
number = {1},
pages = {826--837},
doi = {10.14778/1920841.1920946},
url = {https://doi.org/10.14778/1920841.1920946},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 507 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00017101297 |
| 515 | RoadRunner: Towards Automatic Data Extraction from Large Web Sites | 2001 | VLDB | 0.00016970049 |
| 524 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00016909926 |
| 961 | RankSQL: Query Algebra and Optimization for Relational Top-k Queries | 2005 | SIGMOD | 0.0001282305 |
| 1,396 | Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach | 2008 | SIGMOD | 0.0001079253 |
| 2,614 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 8.2255837e-05 |
| 3,719 | Damia: Data Mashups for Intranet Applications | 2008 | SIGMOD | 7.0718249e-05 |
| 3,893 | Ranking Continuous Probabilistic Datasets | 2010 | VLDB | 6.940442e-05 |
| 4,021 | Robust Web Extraction: An Approach Based on a Probabilistic Tree-Edit Model | 2009 | SIGMOD | 6.8498852e-05 |
| 9,101 | Enabling Enterprise Mashups over Unstructured Text Feeds with InfoSphere MashupHub and SystemT | 2009 | SIGMOD | 5.2283159e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,809 | Mashup by Surfing a Web of Data APIs | 2009 | VLDB |
| 2 | 12,576 | Rank Discovery From Web Databases | 2013 | VLDB |
| 3 | 11,100 | A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores | 2025 | SIGMOD |
| 4 | 6,176 | Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings | 2018 | VLDB |
| 5 | 1,365 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB |
| 6 | 1,886 | Probabilistic Ranking of Database Query Results | 2004 | VLDB |
| 7 | 3,082 | Merging Ranks from Heterogeneous Internet Sources | 1997 | VLDB |
| 8 | 2,620 | Ranking with Uncertain Scoring Functions: Semantics and Sensitivity Measures | 2011 | SIGMOD |
| 9 | 8,514 | URank: Formulation and Efficient Evaluation of Top-k Queries in Uncertain Databases | 2007 | SIGMOD |
| 10 | 12,830 | Autocompletion for Mashups | 2009 | VLDB |