DBScholar

Back to papers

Unstructured Data Bases or Very Efficient Text Searching

Summary: Algorithms for searching massive unstructured text DBs: some operate directly on raw text, others use preprocessing to achieve logarithmic-time queries. Introduces compact signature functions to handle misspellings, variants, positional info and efficient plagiarism detection. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
650
Venue
PODS
Year
1983
Pagerank
-
Overall Rank
14,501 | 0.51%
DOI
10.1145/588058.588074

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{gonnet_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Unstructured Data Bases or Very Efficient Text Searching}},
        url = {https://dl.acm.org/doi/10.1145/588058.588074},
        doi = {10.1145/588058.588074},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gonnet, Gaston H.},
        year = {1983}
}

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 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers