Constraints in XML Schema Integration. This project will produce worldwide leading technologies for designing XML data integration system. With the technologies, the well designed integration systems will be able store data with rich semantics and thus provide accurate and understandable information to users. In this way, Australia and communities will be benefited both financially and informatively. The research of this project will also add to the research reputation of Australia in data integ ....Constraints in XML Schema Integration. This project will produce worldwide leading technologies for designing XML data integration system. With the technologies, the well designed integration systems will be able store data with rich semantics and thus provide accurate and understandable information to users. In this way, Australia and communities will be benefited both financially and informatively. The research of this project will also add to the research reputation of Australia in data integration areas. At the same time, the knowledge capacity of Australia on data integration will be enlarged which further improves frontier research activities in the area. Through the research of the project, PhD students will be trained.Read moreRead less
Using Past Queries for Fast and Accurate Web Searching. Searching the entire Internet, or a company web site, has become a vital task for modern organisations. While there has been significant research into improving search engines through using web pages themselves, very little attention has been paid to improving web search by exploiting the vast numbers of queries that users submit to search engines each day. This project will use state of the art compression and algorithmic techniques to imp ....Using Past Queries for Fast and Accurate Web Searching. Searching the entire Internet, or a company web site, has become a vital task for modern organisations. While there has been significant research into improving search engines through using web pages themselves, very little attention has been paid to improving web search by exploiting the vast numbers of queries that users submit to search engines each day. This project will use state of the art compression and algorithmic techniques to improve the speed and accuracy of web search using data gleaned from millions of Internet queries (provided under agreement by Microsoft). Improving search engines will have a direct benefit to many Australian industries, and support the government's priority area of "smart information use".Read moreRead less
XML Views of Relational Databases: Semantics and Update Problems. XML is the standard for representing, publishing and exchanging data over the Internet and relational database is the dominant technology for data management. Updating XML views over relational data is fundamental to bring these two technologies together to serve Internet-based applications. Australia has been a leading country in both developing and applying internet technologies. The theoretic outcomes of this project will contr ....XML Views of Relational Databases: Semantics and Update Problems. XML is the standard for representing, publishing and exchanging data over the Internet and relational database is the dominant technology for data management. Updating XML views over relational data is fundamental to bring these two technologies together to serve Internet-based applications. Australia has been a leading country in both developing and applying internet technologies. The theoretic outcomes of this project will contribute to the advance in database and web research communities and establish us as an internationally leading group in this research area. The technological outcomes will help organisations in Australia effectively and efficiently conduct e-Business on the Internet. Read moreRead less
On Effectively Answering Why and Why-not Questions in Databases. While the performance and functionality of database systems have gained dramatic improvement, research on improving usability still remains far behind, which results in huge cost of technical support to organisations. This project aims to improve the usability of database systems by effectively answering users' why and why-not questions on query results. This project will invent a novel and generalised model for expressing both the ....On Effectively Answering Why and Why-not Questions in Databases. While the performance and functionality of database systems have gained dramatic improvement, research on improving usability still remains far behind, which results in huge cost of technical support to organisations. This project aims to improve the usability of database systems by effectively answering users' why and why-not questions on query results. This project will invent a novel and generalised model for expressing both the why and why-not questions, efficient strategies for answering questions for complex queries and databases, and novel solutions to scenarios that involve multiple queries. The project will contribute greatly to the fundamental research in query refinement and deliver significant impact on related technology development. Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE140100275
Funder
Australian Research Council
Funding Amount
$392,979.00
Summary
Beyond keyword search for ranked document retrieval. This project will develop novel approaches to efficient and effective ranked text retrieval using a new class of rank-aware algorithms derived from self-indexes. These algorithms can support complex statistical calculations on the fly. Efficient algorithm design for big data is an increasingly important problem as energy costs continue to soar and can now exceed hardware costs for big data consumers such as Google. In this project, two importa ....Beyond keyword search for ranked document retrieval. This project will develop novel approaches to efficient and effective ranked text retrieval using a new class of rank-aware algorithms derived from self-indexes. These algorithms can support complex statistical calculations on the fly. Efficient algorithm design for big data is an increasingly important problem as energy costs continue to soar and can now exceed hardware costs for big data consumers such as Google. In this project, two important problems in web search are explored: real-time indexing and long-form query answering. Using self-index algorithms, this project presents a road map to move beyond simple keyword-based ranked document retrieval, thus allowing us to efficiently meet more demanding information needs of users in the next decade.Read moreRead less
Identifying and Tracking Influential Events in Large Social Networks. This project aims to invent a novel model and techniques for identifying and tracking influential events in large and dynamic social networks in real time. The proposed model would take into account the structure and content of social networks, and the influence of events. The project also plans to develop efficient strategies for identifying and tracking events in large and dynamic social network environments based on the mod ....Identifying and Tracking Influential Events in Large Social Networks. This project aims to invent a novel model and techniques for identifying and tracking influential events in large and dynamic social networks in real time. The proposed model would take into account the structure and content of social networks, and the influence of events. The project also plans to develop efficient strategies for identifying and tracking events in large and dynamic social network environments based on the model, In particular, the project plans to investigate flexible social network query methods to make users’ event search easy. Finally the project plans to build an evaluation system to demonstrate the efficiency of the algorithms and effectiveness of the model.Read moreRead less
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.
Biclique discovery in Big Data. This project aims to design algorithms to capture Big Data. Biclique is a popular graph model that can capture important cohesive structures in many applications. However, traditional biclique discovery algorithms which only focus on simple, small-scale, static and deterministic data are inadequate in the era of Big Data where data has Variety (various formats), Volume (large quantity), Velocity (dynamic update) and Veracity (uncertainty). This project expects to ....Biclique discovery in Big Data. This project aims to design algorithms to capture Big Data. Biclique is a popular graph model that can capture important cohesive structures in many applications. However, traditional biclique discovery algorithms which only focus on simple, small-scale, static and deterministic data are inadequate in the era of Big Data where data has Variety (various formats), Volume (large quantity), Velocity (dynamic update) and Veracity (uncertainty). This project expects to benefit real applications in both public and private sectors and add value to Australian manufactured products.Read moreRead less
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.
Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficie ....Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficient algorithms and data structures for gathering high-quality approximations of the full proximity information, and will use these innovations as the basis for new, practical tools for visualization, and clustering in data mining.Read moreRead less