mogwaing's Williams:HE [4 articles] Export Sort

Recent papers posted to mogwaing's library by the author Williams:HE. You can also see everyone's Williams:HE.

Hide details

	Burst tries: a fast, efficient data structure for string keys [My Copy] ACM Trans. Inf. Syst., Vol. 20, No. 2. (April 2002), pp. 192-223. by Steffen Heinz, Justin Zobel, Hugh E. Williams posted to trie tois data-structure 2002 by mogwaing on 2009-09-30 14:07:49 as along with 3 people kahunar halacsy myui
	Fast phrase querying with combined indexes [My Copy] ACM Trans. Inf. Syst., Vol. 22, No. 4. (2004), pp. 573-594. by Hugh E. Williams, Justin Zobel, Dirk Bahle posted to tois search phrase-queries ir inverted-index 2004 by mogwaing on 2009-09-17 09:15:35 as
	In-place versus re-build versus re-merge: index maintenance strategies for text retrieval systems [My Copy] In ACSC '04: Proceedings of the 27th Australasian conference on Computer science (2004), pp. 15-23. by Nicholas Lester, Justin Zobel, Hugh E. Williams posted to 2004 acsc inverted-index ir by mogwaing on 2009-05-11 11:49:00 as
	Compression of inverted indexes For fast query evaluation [My Copy] In SIGIR '02: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002), pp. 222-229. by Falk Scholer, Hugh E. Williams, John Yiannis, Justin Zobel posted to 2002 inverted-index search sigir by mogwaing on 2009-03-05 06:42:25 as along with 3 people myui monster kikiki

Note: You may cite this page as: http://www.citeulike.org/user/mogwaing/author/Williams:HE

mogwaing's tags

All tags in mogwaing's library

Filter:

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

database	288
vldb	161
icde	137
search	124
2007	116
2005	97
2008	91
sigmod	89
2006	87
2004	82
inverted-index	80
algorithm	66
ir	47
b-tree	37
join	26
p2p	25
distributed-system	24
compression	24
top-k-query	23
2009	22
sigir	21
cikm	19
skyline-query	18
column-store	18
xml	16
suffix-tree	16
knn	16
tods	15
flash-memory	14
data-structure	13
query-optimization	12
2001	12
spire	12
csur	11
io-scheduling	11
sigmod-record	11
replication	11
2002	11
tree	11
intersection-algorithm	11
suffix-array	10
dbms-architecture	10
storage	10
cache	10
multi-core	9
query-processing	9
data-stream	8
graph	8
hash	8
2000	8
tkde	7
similarity-search	7
snapshot	7
1996	7
bulk-operation	7
1999	7
1994	6
oltp	6
moving-objects	6
r-tree	6
www	6
trie	6
1990	6
1992	6
2003	6
storage-model	6
buffer-management	6
spatial	6
file-system	5
string-matching	5
concurrency	5
bitmap-index	5
1984	5
indexing	5
rknn	5
multidimensional-partisioning	5
1997	5
1988	5
document-ordering	5
lock	5
map-reduce	5
olap	4
search-engine	4
dht	4
index-pruning	4
grid-file	4
1986	4
google	4
sort	4
1993	4
range-query	4
stream	4
partial-match	4
data-management	3
query-language	3
1995	3
multi-threaded	3
1998	3
recovery	3
transaction	3
jacm	3
transactional-memory	3
sigops	3
1989	3
read-optimized	3
parallel-processing	3
index-construction	3
hash-join	3
edbt	3
lsm-tree	3
damon	3
acsc	2
design	2
linear-hashing	2
scheduling	2
data-warehouse	2
amazon	2
research	2
db2	2
hyper-dimensional	2
self-tuning	2
index-structure	2
window-query	2
readings	2
tois	2
containment-search	2
sac	2
wea	2
sql-server	2
labeling	2
hadoop	2
oracle	2
cpm	2
extendible-hashing	2
yahoo	2
data-processing	2
survay	2
siam	2
fat-btree	2
1991	2
cache-conscious	2
time-series	2
multi-dimensional	2
lsh	2
pax	2
alenex	2
log-structured	2
iccsa	2
dsms	1
is	1
vecpar	1
tos	1
multimedia-database	1
semantic-web	1
linux	1
linear-mapping	1
semistructured	1
1980	1
materialized-view	1
codd	1
cardinality	1
vee	1
tod	1
multi-join	1
lecture-notes	1
tutorial	1
deim	1
vector-space	1
phrase-queries	1
1979	1
tecs	1
ieee	1
relational-model	1
network	1
bulk-loading	1
dss	1
stoc	1
dam	1
asynchronous-io	1
pattern-matching	1
adc	1
best-paper	1
subsequence-matching	1
monitoring	1
block-oriented	1
index	1
benchmark	1
xml-labeling	1
sparse	1
stream-processing	1
trajectory	1
self-adjusting	1
tsp	1
h-store	1
microsoft	1
louds	1
smt	1
quadtree	1
icdew	1
architecture	1
docid-assignment	1
ideas	1
vldb-j	1
sensor-database	1
xml-search	1
nossdav	1
application-server	1
sensor-network	1
xquery	1
dexa	1
multi-processor	1
clustering	1
succinct	1
big-table	1
row-store	1
encoding	1
talg	1
multiway-join	1
fuzzy-duplicates	1
sigmetrics	1
access-method	1
similarity-join	1
1985	1
n-gram	1
fuzzy-matching	1
bulk-delete	1
goolge	1
dynamic-programming	1
group-by	1
patricia-tree	1
operation	1
ibm	1
hlrs	1
vertical-partitioning	1
temporal	1
string-search	1
file-organization	1
gnn	1
dasfaa	1
serializability	1
sybase	1
simd	1
cracked-database	1
usenix	1
lightweight	1
multi-way-tree	1
snippet	1
platform	1
bst	1
metadata	1
pig	1
x-query	1
pma	1
tocs	1
ldap	1
ic	1
bulk-update	1
binary-tree	1
focs	1
1977	1
1976	1
view	1
field-call	1
select	1
skip-graphs	1
memory	1
prefetch	1
sigarch	1
skip-list	1
multi-attribute-index	1
escrow-locking	1
tomccap	1
query-optimizer	1
dynamo	1
signature-file	1
1974	1
chubby	1
iscis	1
write-optimized	1