Data Retrieval From Massive Information Structures

Grant number: DP140103256 | Funding period: 2014 - 2017

Completed

Abstract

Information search is an essential tool. But most current services regard the data as unstructured collections of independent documents, free of context. Next-generation search applications, such as over social networks, or corporate websites, or XML data sets, must account for the inherent relationships between data items, and must allow the efficient inclusion of search context. Queries should favour semantically local data, giving results that depend on the perceived state of the querier. This project will develop indexing and search techniques for massive structured data sets. The new search methods will incorporate theoretical advances and will be experimentally validated using industry..

View full description

Related publications (15)

Scholarly works icon

Compact inverted index storage using general-purpose compression libraries

Matthias Petri, Alistair Moffat

2018-04-01

Scholarly works icon

Precedence-constrained min sum set cover

J McClintock, J Mestre, A Wirth

2017-12-01

We introduce a version of the Min Sum Set Cover (MSSC) problem in which there are "AND" precedence constraints on the m sets. In t..

Scholarly works icon

Efficient distributed selective search

Yubin Kim, Jamie Callan, J Shane Culpepper, Alistair Moffat

2017-06-01

Scholarly works icon

A cost model for long-term compressed data retention

K Liao, A Moffat, M Petri, A Wirth

2017-01-01

© 2017 ACM. Vast amounts of data are collected and stored every day, as part of corporate knowledge bases and as a response to leg..

Scholarly works icon

ANS-Based Index Compression

Alistair Moffat, Matthias Petri

2017-01-01

Scholarly works icon

Can deep effectiveness metrics be evaluated using shallow judgment pools?

X Lu, A Moffat, J Shane Culpepper

2017-01-01

© 2017 Copyright held by the owner/author(s). Increasing test collection sizes and limited judgment budgets create measurement cha..

Scholarly works icon

CSA : Fast pattern search for large alphabets

S Gog, A Moffat, M Petri

2017-01-01

Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance..

Scholarly works icon

Assessing efficiency-effectiveness tradeoffs in multi-stage retrieval systems without using relevance judgments

Charles LA Clarke, J Shane Culpepper, Alistair Moffat

2016-08-01

Scholarly works icon

Does Selective Search Benefit from WAND Optimization?

Y Kim, J Callan, JS Culpepper, A Moffat

2016-01-01

Scholarly works icon

Effective Construction of Relative Lempel-Ziv Dictionaries

K Liao, M Petri, A Moffat, A Wirth

2016-01-01

Scholarly works icon

Access Time Tradeoffs in Archive Compression

M Petri, A Moffat, PC Nagesh, A Wirth

2015-01-01

Scholarly works icon

On the Cost of Extracting Proximity Features for Term-Dependency Models

X Lu, A Moffat, JS Culpepper

2015-01-01

Scholarly works icon

On the Cost of Phrase-Based Ranking

Matthias Petri, Alistair Moffat

2015-01-01

Scholarly works icon

Graph Representations and Applications of Citation Networks

M Petri, A Moffat, AI WIRTH

2014-01-01

Scholarly works icon

Lazy and eager approaches for the set cover problem

CL Lim, A Moffat, A Wirth

2014-01-01