We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
In this paper, we propose a method for multi-term query expansions based on WordNet. In our approach, Hypernym/Hyponymy and Synonym relations in WordNet is used as the basic expans...
Abstract. We describe design and implementation of the linguistic query language DDDquery. This language aims at querying a large linguistic database storing a corpus of richly ann...
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
Baruch Awerbuch, Robert G. Cole, Reza Curtmola, Da...
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...