Search Results - "Hachem, N.I."
-
1
New order preserving access methods for very large files derived from linear hashing
Published in IEEE transactions on knowledge and data engineering (01-02-1992)“…A class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as the dynamic random-sequential access…”
Get full text
Journal Article -
2
Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base
Published in Computer (Long Beach, Calif.) (01-03-1987)“…Techniques are presented for managing a very large data/knowledge base to support multiple inference mechanisms for logic programming. The frequent requirement…”
Get full text
Journal Article -
3
Back end architecture based on transformed inverted lists-A surrogate file structure for a very large data/knowledge base
Published in [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume I: Architecture Track (1988)“…A detailed analysis is presented of transformed inverted lists (TIL) and an inverted surrogate file structure. A parallel back-end architecture, based on TIL,…”
Get full text
Conference Proceeding
-
4
Key-sequential access methods for very large files derived from linear hashing
Published in [1989] Proceedings. Fifth International Conference on Data Engineering (1989)“…A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access…”
Get full text
Conference Proceeding