Results 1 to 10 of about 2,049,708 (294)
In recent decades, we observed the rapid growth of several big data platforms. Each of them is designed for specific demands. For instance, Spark can efficiently process iterative queries, while Storm is designed for in-memory processing. In this context, the complexity of these distributed systems make it much harder to develop rigorous cost models ...
openaire +2 more sources
Query optimization of distributed database based on multiple ant colony genetic algorithm
In the light of the defect of single algorithm of query optimization,this paper proposes a multiple ant colony genetic algorithm combining the advantages of ant colony algorithm and genetic algorithmwhich overcomes the blindness of early search of ant ...
Zhou Ying, Chen Junhua
doaj +1 more source
LocationSpark: In-memory Distributed Spatial Query Processing and Optimization
Due to the ubiquity of spatial data applications and the large amounts of spatial data that these applications generate and process, there is a pressing need for scalable spatial query processing.
Mingjie Tang +5 more
doaj +1 more source
Enhancing MongoDB query performance through index optimization [PDF]
This article delves into the critical aspect of enhancing query performance in MongoDB through meticulous index optimization. It begins with an introduction to MongoDB's unique document-oriented data storage approach and its inherent scalability, which ...
Nuriev Marat +4 more
doaj +1 more source
Volume data yang sangat besar dari tim surveyor Perencanaan dan Pengendalian Penanganan Bencana(P3B) menciptakan masalah yang luas dan beragam sehingga dapat menghabiskan sumber daya sistem dan waktu pemrosesan yang terbilang lama.
Annisa Heparyanti Safitri +3 more
doaj +1 more source
Distributed Query Optimization by Query Trading
Large-scale distributed environments, where each node is completely autonomous and offers services to its peers through external communication, pose significant challenges to query processing and optimization. Autonomy is the main source of the problem, as it results in lack of knowledge about any particular node with respect to the information it can ...
Pentaris, F., Loannidis, Y.
openaire +3 more sources
Optimization with Uniform Size Queries [PDF]
Let \(f\) be a nonnegative, monotone, submodular set function over an \(n\)-element set \(U\). A \textit{value query} to \(f\) is a set \(S \subseteq U\) and its \textit{reply} is the value \(f(S)\). The authors study the following computational problem: given a positive integer \(k\) and \(f\) as above which can only be accessed using value queries of
Uriel Feige, Moshe Tennenholtz
openaire +2 more sources
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
Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing
As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil +3 more
doaj +1 more source
SPARQL Query Optimization Based on Longest Property Path Filtering [PDF]
A large number of intermediate results during executing SPARQL query greatly affect the query efficiency.For this,a query optimization method with two phases is proposed.In the first phase,it divides a query that contains the same variable into a block ...
LIN Xiaoqing,ZHANG Fu,CHENG Jingwei
doaj +1 more source

