DBScholar

Back to papers

Bit-Sliced VLSI Algorithms for Search and Sort

Summary: Bit-sliced VLSI architectures for interval search and two-way merge sorting enable scalable word length by connecting slices. Shorter slices reduce hardware complexity with little overhead, improving flexibility and feasibility for high-throughput database processing. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7839
Venue
VLDB
Year
1984
Pagerank
-
Overall Rank
14,492 | 0.58%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{tanaka_vldb84,
        title = {{Bit-Sliced VLSI Algorithms for Search and Sort}},
        author = {Tanaka, Yuzuru},
        journal = {PVLDB},
        series = {{VLDB} '84},
        pages = {225},
        year = {1984}
}

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