Data retrieval from massive information structures. 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 th ....Data retrieval from massive information structures. 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-standard open-source distributed systems.Read moreRead less
Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require c ....Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require computational techniques that run extremely efficiently. The project expects to develop and improve approximate data structures that operate in tight resource bounds. Anticipated outcomes are improved event recognition and dramatic speedup in analysis of streams in areas such as finance, health, transport, and urban data.Read moreRead less
Next-generation techniques for analysing massive data sets. To process enormous amounts of data, leading computing companies are turning to modern computing frameworks, for which little theory of efficient computational techniques has been developed. This project will resolve key theoretical questions and provide fast techniques for poorly understood pattern recognition and bioinformatics problems.
Efficient and effective algorithms for searching strings in secondary storage. Pattern searching is fundamental to a wide range of computing applications, including web search and bioinformatics. In this project we will develop compression algorithms and hybrid memory-disk search structures that allow fast pattern matching on sequences of textual and numeric data, including when approximate search is required.
On effectively modelling and efficiently discovering communities from large networks. Finding and maintaining close communities from very large scale, dynamically changing networks is interesting and challenging. This project aims to develop new techniques to identify such communities as fast as possible through exploiting the rich semantics and individual relationships within the communities.
New Efficient Cryptographic Tools for Data Privacy and Software Protection. Online services for collaborative communication and software distribution are commonplace today, but their use is hampered by data privacy breaches and intellectual property violations via software reverse engineering. Recent theoretical breakthroughs in cryptography promise to provide new powerful tools for solving these problems, but these tools are not yet suitable for practical use, due to their low efficiency and a ....New Efficient Cryptographic Tools for Data Privacy and Software Protection. Online services for collaborative communication and software distribution are commonplace today, but their use is hampered by data privacy breaches and intellectual property violations via software reverse engineering. Recent theoretical breakthroughs in cryptography promise to provide new powerful tools for solving these problems, but these tools are not yet suitable for practical use, due to their low efficiency and a lack of solid security foundations. This project aims to apply algebraic and probabilistic techniques to improve efficiency of existing tools, and the understanding of their security. Outcomes are expected to include new insights in cryptographic theory, and new practical tools for cyber security.Read moreRead less
Efficient structure search over large graphs. The project aims to develop advanced search technology to support large-scale graph applications. The success of the project not only brings a breakthrough in technology development but also provides training for high quality personnel in this important and growing area, and brings considerable economic and social benefits to Australia.