![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Hugh E. Williams 6 Adam Cannane , Hugh E. Williams: A Compression Scheme for Large Databases. Australasian Database Conference 2000 : 6-11 5 Hugh E. Williams, Justin Zobel , Phil Anderson : What's Next? Index Structures for Efficient Phrase Querying. Australasian Database Conference 1999 : 141-152 4 Adam Cannane , Hugh E. Williams, Justin Zobel : A General-Purpose Compression Scheme for Databases. Data Compression Conference 1999 : 519 3 Justin Zobel , Hugh E. Williams: Compact In-Memory Models for Compression of Large Text Databases. SPIRE/CRIWG 1999 : 224-231 2 Hugh E. Williams, Justin Zobel : Compressing Integers for Fast File Access. The Computer Journal 42 (3): 193-201 (1999) 1 Hugh E. Williams: Cafe: An Indexed Approach to Searching Genomic Databases. SIGIR 1998 : 389 DiSC'01 Copyright ©2002 ACM Inc. |