Results 211 to 220 of about 35,488 (260)

Multi-query Optimization for Distributed Similarity Query Processing

2008 The 28th International Conference on Distributed Computing Systems, 2008
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluation plan. To the best of our knowledge, this is the first work investigating a multi- query optimization technique for distributed similarity query processing (MDSQ).
Yi Zhuang 0001, Qing Li 0001, Lei Chen 0002   +2 more
openaire   +1 more source

Query Processing in Highly Distributed Environments

2021
This paper will demonstrate a novel method for consolidating data in an engineered hypercube network for the purpose of optimizing query processing. Query processing typically calls for merging data collected from a small subset of server nodes in a network. This poses the problem of managing efficiently the exchange of data between processing nodes to
Akira Kawaguchi, Nguyen Viet Ha 0002, Masato Tsuru 0001, Abbe Mowshowitz, Masahiro Shibata   +4 more
openaire   +1 more source

Towards Certified Distributed Query Processing [PDF]

, 2023
In recent years, knowledge graphs (KGs) have gained more and more importance. As a consequence of that, the number of publicly accessible KGs is increasing. Due to their adoption in many areas, KGs are used in numerous different applications. However, these knowledge graph applications are not developed by the data owners and they might collect data ...
Philipp D. Rohde, Maria-Esther Vidal
openaire   +1 more source

A threshold mechanism for distributed query processing

Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
A strategy to process a distributed query is formed using estimates for partial results sizes and delays/costs associated with the network data transfer and CPU processing. To guard against inaccurate estimates the strategy execution is monitored and if estimates are observed to be “inaccurate” the strategy is corrected.
Peter Bodorik, J. Spruce Riordon
openaire   +1 more source

Compliant Geo-distributed Query Processing

Proceedings of the 2021 International Conference on Management of Data, 2021
In this paper, we address the problem of compliant geo-distributed query processing. In particular, we focus on dataflow policies that impose restrictions on movement of data across geographical or institutional borders. Traditional ways to distributed query processing do not consider such restrictions and therefore in geo-distributed environments may ...
Kaustubh Beedkar, Jorge-Arnulfo Quiané-Ruiz, Volker Markl   +2 more
openaire   +1 more source

Deciding to correct distributed query processing

IEEE Transactions on Knowledge and Data Engineering, 1992
Most algorithms for determining query processing strategies in distributed databases are static in nature; that is, the strategy is completely determined on the basis of a priori estimates of the size of intermediate results, and it remains unchanged throughout its execution. The static approach may be far from optimal because it denies the opportunity
Peter Bodorik, J. Spruce Riordon, James S. Pyra   +2 more
openaire   +1 more source

Evaluation dynamic processing of distributed queries

[1988] Proceedings. The 8th International Conference on Distributed, 2003
Several issues that arise in processing distributed queries dynamically are investigated. The effect of inaccuracies in estimation on the cost/delay of strategies is considered. Two methods than can be used to decide whether or not to correct a strategy are examined and compared.
Peter Bodorik, J. Spruce Riordon
openaire   +1 more source

Distributed query processing optimization objectives

Proceedings. Fourth International Conference on Data Engineering, 2003
The authors examine objectives, or measures of cost, which can be used in optimizing queries in a distributed database (DDB). They include the delay and dollar cost due to the network data transfer, CPU processing or a combination of both, and cost measures in terms of the size of partial results. These measures are used in distributed query processing
Peter Bodorik, J. Spruce Riordon
openaire   +1 more source

Query Processing in Distributed Information Systems

Fundamenta Informaticae, 1991
In our model of a distributed information system, two information structures are maintained – the application database and the (routing) database used to route queries in a computer network. Any site of a distributed information system which does not understand some attribute values used in a query has to search for a site which can explain them.
openaire   +2 more sources

Distributed Query Processing

2019
By hiding the low-level details about the physical organization of the data, relational database languages allow the expression of complex queries in a concise and simple manner. In particular, to construct the answer to the query, the user does not precisely specify the procedure to follow; this procedure is actually devised by a module, called a ...
M. Tamer Özsu, Patrick Valduriez
openaire   +1 more source