  | 1998 | 
| 12 |             | Andreas Koeller,
Elke A. Rundensteiner,
Nabil I. Hachem:
Integrating the Rewriting and Ranking Phases of View Synchronization.
DOLAP 1998: 60-65 | 
 | 1997 | 
| 11 |             | Steve Taylor,
Nabil I. Hachem,
Stanley M. Selkow:
The Average Height of a Node in the BANG Abstract Directory Tree.
Inf. Process. Lett. 61(1): 55-61 (1997) | 
 | 1996 | 
| 10 |             | Nabil I. Hachem,
Chenye Bao,
Steve Taylor:
Approximate Query Answering In Numerical Databases.
SSDBM 1996: 63-73 | 
 | 1993 | 
| 9 |             | Yuhong Zhang,
Matthew O. Ward,
Nabil I. Hachem,
Michael A. Gennert:
A Visual Programming Environment for Supporting Scientific Data Analysis.
VL 1993: 368-370 | 
| 8 |             | Nabil I. Hachem,
Ke Qiu,
Michael A. Gennert,
Matthew O. Ward:
Managing Derived Data in the Gaea Scientific DBMS.
VLDB 1993: 1-12 | 
| 7 |             | Nabil I. Hachem,
Michael A. Gennert,
Matthew O. Ward:
An Overview of the Gaea Project.
IEEE Data Eng. Bull. 16(1): 29-32 (1993) | 
| 6 |             | Nabil I. Hachem:
An Approximate Analysis of the Performance of Extendible Hashing with Elastic Buckets.
Inf. Process. Lett. 48(1): 13-20 (1993) | 
 | 1992 | 
| 5 |             | Ke Qiu,
Nabil I. Hachem,
Matthew O. Ward,
Michael A. Gennert:
Providing Temporal Support in Data Base Management Systems for Global Change Research.
SSDBM 1992: 274-289 | 
| 4 |             | Nabil I. Hachem,
P. Bruce Berra:
New Order Preserving Access Methods for Very Large Files Derived From Linear Hashing.
IEEE Trans. Knowl. Data Eng. 4(1): 68-82 (1992) | 
 | 1991 | 
| 3 |             | Steve Taylor,
Nabil I. Hachem:
A Direct Algorithm for Computing the Transitive Closure of a Two-Dimensionally Structured File.
MFDBS 1991: 146-159 | 
 | 1989 | 
| 2 |             | Nabil I. Hachem,
P. Bruce Berra:
Key-Sequential Access Methods for Very Large Files Derived from Linear Hashing.
ICDE 1989: 305-312 | 
 | 1987 | 
| 1 |             | P. Bruce Berra,
Soon Myoung Chung,
Nabil I. Hachem:
Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base.
IEEE Computer 20(3): 25-32 (1987) |