the proceedings contain 110 papers. the topics discussed include: improving quality and convergence of genetic query optimizers;a path-based approach for efficient structural join with not-predicates;ITREKS: keyword s...
详细信息
ISBN:
(纸本)9783540717027
the proceedings contain 110 papers. the topics discussed include: improving quality and convergence of genetic query optimizers;a path-based approach for efficient structural join with not-predicates;ITREKS: keyword search over relational database by indexing tuple relationship;mining closed frequent free trees in graph databases;mining time-delayed associations from discrete event datasets;a comparative study of ontology based term similarity measures on PubMed document clustering;an adaptive and efficient unsupervised shot clustering algorithm for sports video;correlation-based detection of attribute outliers;an efficient histogram method for outlier detection;privacy preserving data mining of sequential patterns for network traffic data;privacy preserving clustering for multi-party;an efficient implementation for MOLAP basic data structure and its evaluation;and similarity joins of text with incomplete information formats.
In recent years, there has been a notable rise in the application of machine learning to cost estimation for query optimization. Central to an effective cost model are the abilities of accuracy, efficiency, lightness,...
详细信息
ISBN:
(纸本)9789819609130;9789819609147
In recent years, there has been a notable rise in the application of machine learning to cost estimation for query optimization. Central to an effective cost model are the abilities of accuracy, efficiency, lightness, and generalizability. However, traditional cost models are based on heuristics thus lack of accuracy. On the other hand, the learned cost models frequently struggle to strike a balance between accuracy and efficiency, with many lacking broad applicability. To combat these challenges, we introduce FAIth, a fast, accurate, and database-agnostic learned cost model. FAIth harnesses data from multiple sources to learn cross-database meta-knowledge. It is then effectively refined, leveraging the unique data information from the target database via an Adapter we developed. Proven through various benchmarks, FAIth consistently showcases its prowess in delivering accurate and robust cost estimations.
the 12th international conference on database systems for advanced applications (dasfaa), organized jointly by the Asian Institute of Technology, National Electronics and Computer Technology Center and Sirindhorn Inte...
详细信息
ISBN:
(数字)9783540717034
ISBN:
(纸本)9783540717027
the 12th international conference on database systems for advanced applications (dasfaa), organized jointly by the Asian Institute of Technology, National Electronics and Computer Technology Center and Sirindhorn international Institute of Technology, sought to provide information to users and practitioners of database and databasesystems on advancedapplications. the dasfaaconference series has already established itself and it continues to attract, each year, participants from all over the world. In this context, it may be recalled that the previous dasfaaconferences were successfully held in Seoul, Korea (1989), Tokyo, Japan (1991), Daejeon, Korea (1993), Singapore (1995), Melbourne, Australia (1997), Taiwan, ROC (1999), Hong Kong (2001), Kyoto, Japan (2003), Jeju Island, Korea (2004), Beijing, China (2005) and Singapore (2006). thailand had the opportunity to host this prestigious and important internationalconference and join the league. this conference provides an international forum for academic exchanges and technical discussions among researchers, developers and users of databases from academia, business and industry. dasfaa focuses on research in databasetheory, development of advanced DBMS technologies and their advancedapplications. It also promotes research and development activities in the field of databases among participants and their institutions from Pacific Asia and the rest of the world .
this demonstration presents OntoDB, a prototype that allows to store explicitly in the database not only the data, but also the conceptual model defining the structure of data and the domain ontology representing the ...
详细信息
this paper focuses on the issue of geographical data's copyrights protection. A Geo-WDBMS has been built by embedding the watermarking functions into the inner code of the open source DBMS PostgreSQL. And its core...
详细信息
Keyword-based search is well studied in the world of text documents and Internet search engines. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In...
详细信息
Free tree, as a special graph which is connected, undirected and acyclic, has been extensively used in bioinformatics, pattern recognition, computer networks, XML databases, etc. Recent research on structural pattern ...
详细信息
the skyline queries help users make intelligent decisions over complex data. It has been recently extended to the uncertain databases due to the existence of uncertainty in many real-world data. In this paper, we tack...
详细信息
ISBN:
(纸本)9783642202445
the skyline queries help users make intelligent decisions over complex data. It has been recently extended to the uncertain databases due to the existence of uncertainty in many real-world data. In this paper, we tackle the problem of probabilistic skyline retrieval on physically distributed uncertain data with low bandwidth consumption. the previous work incurs sharply increased communication cost when the underlying dataset is anti-correlated, which is the typical scenario that the skyline is useful. In this paper, we propose a knowledge sharing approach based on a novel grid-based data summary. By sharing the data summary that captures the global data distribution, each local site is able to identify large amounts of unqualified objects early. Extensive experiments on both efficiency and scalability have demonstrated that our approach outperforms the competitor.
When an event is emerging and actively discussed on social networks, its related issues may change from time to time. People may focus on different issues of an event at different times. An invariant event is an event...
详细信息
ISBN:
(纸本)9783319181233;9783319181226
When an event is emerging and actively discussed on social networks, its related issues may change from time to time. People may focus on different issues of an event at different times. An invariant event is an event with changing subsequent issues that last for a period of time. Examples of invariant events include government elections, natural disasters, and breaking news. this paper describes our demonstration system for tracking invariant events over social networks. Our system is able to summarize continuous invariant events and track their developments along a timeline. We propose invariant event detection by utilizing an approach of Clique Percolation Method (CPM) community mining. We also present an approach to event tracking based on the relationships between communities. the Twitter messages related to the 2013 Australian Federal Election are used to demonstrate the effectiveness of our approach. As the first of this kind, our system provides a benchmark for further development of monitoring tools for social events.
With advances in geo-positioning technologies and ensuing location based service, there are a rapid growing amount of trajectories associated with textual information collected in many emerging applications. For insta...
详细信息
ISBN:
(纸本)9783319181233;9783319181226
With advances in geo-positioning technologies and ensuing location based service, there are a rapid growing amount of trajectories associated with textual information collected in many emerging applications. For instance, nowadays many people are used to sharing interesting experience through Foursquare or Twitter along their travel routes. In this paper, we investigate the problem of spatial keyword range search on trajectories, which is essential to make sense of large amount of trajectory data. To the best of our knowledge, this is the first work to systematically investigate range search over trajectories where three important aspects, i.e., spatio, temporal and textual, are all taken into consideration. Given a query region, a timespan and a set of keywords, we aim to retrieve trajectories that go through this region during query timespan, and contain all the query keywords. To facilitate the range search, a novel index structure called IOC-Tree is proposed based on the inverted indexing and octree techniques to effectively explore the spatio, temporal and textual pruning techniques. Furthermore, this structure can also support the query with order-sensitive keywords. Comprehensive experiments on several real-life datasets are conducted to demonstrate the efficiency.
暂无评论