Results 31 to 40 of about 327,421 (217)
According to the characteristics of massive, multi-source, heterogeneous, and rapid growth of book literature data information from the perspective of the metaverse, in order to meet the requirements of efficient management and rapid retrieval such as ...
Dailin Wang, Lina Liu, Yali Liu
doaj +1 more source
Query Generation based on Generative Adversarial Networks [PDF]
Many problems in database systems, such as cardinality estimation, database testing and optimizer tuning, require a large query load as data. However, it is often difficult to obtain a large number of real queries from users due to user privacy restrictions or low frequency of database access.
arxiv
XPath whole query optimization [PDF]
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization.
Kim Nguyen, Sebastian Maneth
openaire +3 more sources
A Cardinality Estimator in Complex Database Systems Based on TreeLSTM
Cardinality estimation is critical for database management systems (DBMSs) to execute query optimization tasks, which can guide the query optimizer in choosing the best execution plan.
Kaiyang Qi, Jiong Yu, Zhenzhen He
doaj +1 more source
Learned Query Optimization by Constraint-Based Query Plan Augmentation
Over the last decades, various cost-based optimizers have been proposed to generate optimal plans for SQL queries. These optimizers are key to achieving good performance in database systems and can speed up query execution.
Chen Ye+4 more
doaj +1 more source
Design and analysis of stochastic DSS query optimizers in a distributed database system
Query optimization is a stimulating task of any database system. A number of heuristics have been applied in recent times, which proposed new algorithms for substantially improving the performance of a query.
Manik Sharma+2 more
doaj +1 more source
Ontological queries: Rewriting and optimization
Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an
Georg Gottlob+2 more
openaire +3 more sources
Faced with the rapid growth of vector data and the urgent requirement of low-latency query, it has become an important and timely challenge to effectively achieve the scalable storage and efficient access of vector big data.
Hua Jiang+6 more
doaj +1 more source
Learned Query Superoptimization [PDF]
Traditional query optimizers are designed to be fast and stateless: each query is quickly optimized using approximate statistics, sent off to the execution engine, and promptly forgotten. Recent work on learned query optimization have shown that it is possible for a query optimizer to "learn from its mistakes," correcting erroneous query plans the next
arxiv
Query Optimization for Ontology-Mediated Query Answering [PDF]
International ...
Wafaa El Husseini+3 more
openaire +1 more source