Results 271 to 280 of about 476,420 (328)
Some of the next articles are maybe not open access.

AvantGraph query processing engine

Proceedings of the VLDB Endowment, 2022
We demonstrate AvantGraph, a graph query processing engine developed by the Database group at TU Eindhoven. Designed for efficient processing of both subgraph matching and navigational graph queries, AvantGraph encompasses innovation in three key areas: the planner, the cardinality estimator, and the execution ...
van Leeuwen, Wilco   +4 more
openaire   +1 more source

Query Relaxation in Cooperative Query Processing

2009
This chapter explores new trends of query relaxation strategies that allow to implement a cooperative query processing paradigm. This new paradigm is based on the belief that the user has an idea of what he/she wants and the system has to automatically lead him/her to formulate meaningful queries by relaxing query constraints.
D'Ulizia Arianna   +2 more
openaire   +3 more sources

Graph Query Processing

2018
While being eminently useful in a wide variety of application domains, the high expressiveness of graph queries makes them hard to optimize and, hence, challenging to process efficiently. We discuss a number of state-of-the-art approaches which aim to overcome these challenges, focusing specifically on planning, optimization, and execution of two ...
Salihoglu, Semih, Yakovets, N.
openaire   +2 more sources

Data Stream Query Processing

21st International Conference on Data Engineering (ICDE'05), 2003
This tutorial provides a comprehensive and cohesive overview of the key research results in the area of data stream query processing, both for SQL-like and XML query languages.
N. Koudas, D. Srivastava
openaire   +1 more source

Query Processing in PIOS

1995
An approach to query processing in object-oriented stores supporting physical data independence is proposed in this Chapter. In particular, the problem of query optimisation (i e finding efficient execution plans for declarative queries) is investigated. A set of rewrite rules has been defined in order to allow an algebraic optimisation phase.
Rabitti F, Benedetti L, Demi F
openaire   +2 more sources

Robust Query Processing: Mission Possible

2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019
Robust query processing with strong performance guarantees is an extremely desirable objective in the design of industrial-strength database engines. However, it has proved to be a largely intractable and elusive challenge in spite of sustained efforts spanning several decades.
openaire   +1 more source

Distributed query processing

ACM Computing Surveys, 1984
In this paper, various techniques for optimizing queries in distributed databases are presented. Although no attempt is made to cover all proposed algorithms on this topic, quite a few ideas extracted from existing algorithms are outlined. It is hoped that large-scale experiments will be conducted to verify the usefulness of these ideas and that they ...
Yu, C. T., Chang, C. C.
openaire   +2 more sources

Process Querying Methods

2022
This book is mainly intended for researchers. All the chapters in this book are contributed by active researchers in the research disciplines of business process management, process mining, and process querying.
openaire   +2 more sources

Intermittent query processing

Proceedings of the VLDB Endowment, 2019
Many applications ingest data in an intermittent, yet largely predictable, pattern. Existing systems tend to ignore how data arrives when making decisions about how to update (or refresh) an ongoing query. To address this shortcoming we propose a new query processing paradigm, Intermittent Query Processing (IQP), that bridges query execution and ...
Dixin Tang   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy