DBScholar

Back to papers

Autocompletion for Mashups

Summary: MatchUp enables fast mashup construction via autocompletion that suggests missing components and glue from shared mashup patterns. A novel data model and ranking metric enable the approach, with a top-k algorithm provably optimal and validated. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10155
Venue
VLDB
Year
2009
Pagerank
5.093636e-05
Overall Rank
12,540 | 13.97%
DOI
10.14778/1687627.1687689

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{greenshpan_vldb09,
        title = {{Autocompletion for Mashups}},
        author = {Greenshpan, Ohad and Milo, Tova and Polyzotis, Neoklis},
        journal = {PVLDB},
        series = {{VLDB} '09},
        doi = {10.14778/1687627.1687689},
        url = {https://doi.org/10.14778/1687627.1687689},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,470 Navigating in Complex Mashed-Up Applications 2010 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers