DBScholar

Back to papers

Efficient Type-Ahead Search on Relational Data: a TASTIER Approach

Summary: Type-ahead keyword search on relational data with Tastier; results appear as you type. Proposes compact indexes, partition-based pruning, and query-prediction to achieve millisecond responses on large, multi-table datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4219
Venue
SIGMOD
Year
2009
Pagerank
6.9372074e-05
Overall Rank
4,048 | 72.23%
DOI
10.1145/1559845.1559918

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{li_sigmod09,
        title = {{Efficient Type-Ahead Search on Relational Data: a TASTIER Approach}},
        author = {Li, Guoliang and Ji, Shengyue and Li, Chen and Feng, Jianhua},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559918},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559918},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 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