Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2024
LiteSelect: A Lightweight Adaptive Learning Algorithm for Online Index Selection
AbstractUsing appropriately selected indexes can dramatically improve the performance of query workloads in database systems. Typically, the access patterns of the workloads in real-world applications change frequently. This poses the challenge of ...
- research-articleJuly 2023
A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs
AbstractGraph pattern matching is a fundamental operation for exploring and analyzing large graphs, which are widely used to represent entities and their relationships in a plethora of applications. However, existing algorithms do not perform ...
- ArticleApril 2022
Efficient In-Memory Evaluation of Reachability Graph Pattern Queries on Data Graphs
AbstractGraphs are a widely used data model in modern data-intensive applications. Graph pattern matching is a fundamental operation for the exploration and analysis of large data graphs. In this paper, we present a novel approach for efficiently finding ...
- research-articleMay 2021
Discovering closed and maximal embedded patterns from large tree data
AbstractMany current applications and systems produce large tree datasets and export, exchange, and represent data in tree-structured form. Extracting informative patterns from large data trees is an important research direction with multiple ...
- ArticleOctober 2020
Leveraging Double Simulation to Efficiently Evaluate Hybrid Patterns on Data Graphs
Web Information Systems Engineering – WISE 2020Pages 255–269https://doi.org/10.1007/978-3-030-62005-9_19AbstractLabeled graphs are used to represent entities and their relationships in a plethora of Web applications. Graph pattern matching is a fundamental operation for the analysis and exploration of data graphs. In this paper, we address the problem of ...
-
- ArticleAugust 2019
Efficiently Computing Homomorphic Matches of Hybrid Pattern Queries on Large Graphs
AbstractIn this paper, we address the problem of efficiently finding homomorphic matches for hybrid patterns over large data graphs. Finding matches for patterns in data graphs is of fundamental importance for graph analytics. In hybrid patterns, each ...
- ArticleApril 2019
Evaluating Mixed Patterns on Large Data Graphs Using Bitmap Views
AbstractDeveloping efficient and scalable techniques for pattern queries over large graphs is crucial for modern applications such as social networks, Web analysis, and bioinformatics. In this paper, we address the problem of efficiently finding the ...
- research-articleJune 2018
Personalized Keyword Search on Large RDF Graphs based on Pattern Graph Similarity
IDEAS '18: Proceedings of the 22nd International Database Engineering & Applications SymposiumPages 12–21https://doi.org/10.1145/3216122.3216167The structure of the ever increasing large RDF repositories is too complex to allow non-expert users extract useful information from them. Keyword search is an interesting alternative but in the context of RDF graph data, where query answers are RDF ...
- ArticleMay 2018
Efficient Discovery of Embedded Patterns from Large Attributed Trees
AbstractDiscovering informative patterns deeply hidden in large tree datasets is an important research area that has many practical applications. Many modern applications and systems represent, export and exchange data in the form of trees whose nodes are ...
- articleSeptember 2017
Relaxation of keyword pattern graphs on RDF Data
One of the facets of the data explosion in recent years is the growing of the repositories of RDF Data on the Web. Keyword search is a popular technique for querying repositories of RDF graph data. Recently, a number of approaches leverage a structural ...
- ArticleJune 2015
Keyword Pattern Graph Relaxation for Selective Result Space Expansion on Linked Data
ICWE 2015: Proceedings of the 15th International Conference on Engineering the Web in the Big Data Era - Volume 9114Pages 287–306https://doi.org/10.1007/978-3-319-19890-3_19Keyword search is a popular technique for querying the ever growing repositories of RDF graph data. In recent years different approaches leverage a structural summary of the graph data to address the typical keyword search related problems. These ...
- articleJune 2015
Reasoning with patterns to effectively answer XML keyword queries
The VLDB Journal — The International Journal on Very Large Data Bases (VLDB), Volume 24, Issue 3Pages 441–465https://doi.org/10.1007/s00778-015-0384-3Keyword search is a popular technique for searching tree-structured data on the Web because it frees the user from knowing a complex query language and the structure of the data sources. However, the imprecision of the keyword queries usually results in ...
- articleMay 2015
Configuring bitmap materialized views for optimizing XML queries
World Wide Web (WWWJ), Volume 18, Issue 3Pages 607–632In recent years the inverted lists evaluation model along with holistic stack-based algorithms have been established as the most prominent techniques for evaluating XML queries on large persistent XML data. In this framework, we are using materialized ...
- research-articleJanuary 2015
Top-k-size keyword search on tree structured data
Keyword search is the most popular technique for querying large tree-structured datasets, often of unknown structure, in the web. Recent keyword search approaches return lowest common ancestors (LCAs) of the keyword matches ranked with respect to their ...
- articleSeptember 2013
Optimizing XML queries: Bitmapped materialized views vs. indexes
Optimizing queries using materialized views has not been addressed adequately in the context of XML due to the many limitations associated with the definition and usability of materialized views in traditional XML query evaluation models. In this paper, ...
- articleApril 2013
A survey on XML streaming evaluation techniques
The VLDB Journal — The International Journal on Very Large Data Bases (VLDB), Volume 22, Issue 2Pages 177–202https://doi.org/10.1007/s00778-012-0281-yXML is currently the most popular format for exchanging and representing data on the web. It is used in various applications and for different types of data including structured, semistructured, and unstructured heterogeneous data types. During the ...
- research-articleDecember 2012
Processing and Evaluating Partial Tree Pattern Queries on XML Data
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 12Pages 2244–2259https://doi.org/10.1109/TKDE.2011.137XML query languages typically allow the specification of structural patterns using XPath. Usually, these structural patterns are in the form of trees (Tree-Pattern Queries—TPQs). Finding the occurrences of such patterns in an XML tree is a key operation ...
- research-articleMay 2012
Efficient keyword search on large tree structured datasets
KEYS '12: Proceedings of the Third International Workshop on Keyword Search on Structured DataPages 63–74https://doi.org/10.1145/2254736.2254749Keyword search is the most popular paradigm for querying XML data on the web. In this context, three challenging problems are (a) to avoid missing useful results in the answer set, (b) to rank the results with respect to some relevance criterion and (c) ...
- ArticleJuly 2011
Efficient storage and temporal query evaluation in hierarchical data archiving systems
SSDBM'11: Proceedings of the 23rd international conference on Scientific and statistical database managementPages 109–128Data archiving has been commonly used in many fields for data backup and analysis purposes. Although comprehensive application software, new computing and storage technologies, and the Internet have made it easier to create, collect and store all types ...
- articleDecember 2010
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patterns or tree patterns. Current applications of XML require querying of ...