Results 251 to 260 of about 3,172,290 (290)
Some of the next articles are maybe not open access.
A graph query language and its query processing
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), 1999Many new database applications involve querying of graph data. We present an object-oriented graph data model, and an OQL like graph query language, GOQL. The data model and the language are illustrated in the application domain of multimedia presentation graphs.
Lei Sheng +2 more
openaire +2 more sources
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
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
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW), 2016
Robust query processing, a long-standing problem, is about performance, predictability and ability to avoid sudden disruptions in performance. While query optimizer being an important component of query processing, my thesis focuses on query optimizer robustness which is mainly plagued with the problem of cardinality mis-estimates. Moreover, it is well
openaire +2 more sources
Robust query processing, a long-standing problem, is about performance, predictability and ability to avoid sudden disruptions in performance. While query optimizer being an important component of query processing, my thesis focuses on query optimizer robustness which is mainly plagued with the problem of cardinality mis-estimates. Moreover, it is well
openaire +2 more sources
Abstraction in query processing
Journal of the ACM, 1991Summary: Possible simplifications in query processing are investigated if, consciously, it is agreed to use query languages of limited power (i.e., weaker and proper sublanguages of first-order language). In such a situation, it is frequently possible to transform data in the database into some other form that is not necessarily logically equivalent to
openaire +1 more source
Distributed Processing of Similarity Queries
Distributed and Parallel Databases, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Apostolos Papadopoulos +1 more
openaire +2 more sources
Query Processing and Optimization for Pictorial Query Trees
1999Methods for processingo f pictorial queries specified by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries while internal nodes correspond to logical operations on them. Algorithms for processing individual pictorial queries and for parsing and computingt he overall result of a pictorial ...
Aya Soffer, Hanan Samet
openaire +2 more sources
Distributed Query Processing on the Grid
The International Journal of High Performance Computing Applications, 2002Distributed query processing (DQP) has been widely used in data intensive applications where data of relevance to users are stored at multiple locations. This paper argues: (i) that DQP can be important in the Grid, as a means of providing high-level, declarative languages for integrating data access and analysis; and (ii) that the Grid provides ...
Jim Smith 0001 +5 more
openaire +4 more sources
Aero: Adaptive Query Processing of ML Queries
Proceedings of the ACM on Management of DataQuery optimization is critical in relational database management systems (DBMSs) for ensuring efficient query processing. The query optimizer relies on precise selectivity and cost estimates to generate optimal query plans for execution. However, this static query optimization approach falls short for DBMSs handling machine learning (ML) queries.
Gaurav Tarlok Kakkar +4 more
openaire +1 more source
Query Processing in Relationlog
1999Relationlog is a persistent deductive database system that supports effective storage, effcient access and inference of large amounts of data with complex structures. In this paper, we describe query processing in the Relationlog system. In particular, we illustrate the extended semi-naive and magic-set techniques used in Relationlog.
openaire +2 more sources
Cognitive Processes in Query Generation
2011Known-item search is the search for a specific document that is known to exist. This task is particularly important in Personal Information Management (PIM), where it is the most common search activity. A major obstacle to research in search technologies for PIM is the lack of publicly accessible test corpora.
Hauff C., Houben G.-J.
openaire +2 more sources