IEEE Micro · 1991 · 16 citations · 8 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureDatabasesParallel ComputingDatabase ManagementHardware AccelerationParallel SearchingQuery OptimizationQuery ProcessingRelational AlgebraData ProcessorDatabase SortingMain Memory OrganizationParallel IndexingParallel Query ProcessingQuery Performance OptimizationRelational Database SystemsRelational Query Processing
Rinda, a database processor that accelerates nonindexed relational database queries, is described. Rinda is composed of content search processors and relational operational accelerating processors; the former, search rows stored in disk storage, and the latter sort rows stored in the main memory. The processors connect to a general-purpose host computer with channel interfaces. Performance results show that Rinda executes queries three to 100 times faster then conventional database-management system software in a benchmark system.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
Storage and access in relational data bases
Michael W. Blasgen, Kapali P. Eswaran · IBM Systems Journal · 1977 · 229 citations
Key-to-address transform techniques
Vincent Y. Lum, Peter Yuen, Michael Dodd · Communications of the ACM · 1971 · 110 citations · Full text