Results 291 to 300 of about 247,233 (313)

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

QoS-aware distributed query processing

Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99, 1999
In the environment of wide-area networks such as the Internet, distributed query processing is becoming problematic due to changes of the underlying networks and user requirements. In this new context, conventional query processing strategies with the homogeneous assumption will not work well, because they are unable to adapt to unexpected changes in ...
H. Ye, B. Kerherve, G. von Bochmann
openaire   +1 more source

Optimal Query Processing for Distributed Database Systems

IEEE Transactions on Computers, 1982
A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost (processing cost and communication cost), which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the
Chu, Wesley W., Hurley, Paul
openaire   +2 more sources

Towards distributed processing of RDF path queries

International Journal of Web Engineering and Technology, 2005
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Suite are widely used for building semantic web applications. Currently, none of these systems support the integrated querying of distributed RDF repositories. We consider this a
Stuckenschmidt, H., Vdovjak, Richard, Broekstra, J., Houben, Geert-Jan   +3 more
openaire   +3 more sources

Robust Distributed Query Processing for Streaming Data

ACM Transactions on Database Systems, 2014
Distributed stream processing systems must function efficiently for data streams that fluctuate in their arrival rates and data distributions. Yet repeated and prohibitively expensive load reallocation across machines may make these systems ineffective, potentially resulting in data loss or even system failure. To overcome this problem, we
Lei, Chuan, Rundensteiner, Elke A.
openaire   +1 more source

An Optimal Algorithm for Processing Distributed Star Queries

IEEE Transactions on Software Engineering, 1985
The problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for a special type of queries called star queries, we have developed a polynomial optimal algorithm. Semijoin tactics are applied for query processing.
Li, Victor OK, Chen, Arbee LP
openaire   +3 more sources

Efficient OLAP query processing in distributed data warehouses

Proceedings 18th International Conference on Data Engineering, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akinde, Michael O., Böhlen, Michael H., Johnson, Theodore, Lakshmanan, Laks V. S., Srivastava, Divesh   +4 more
openaire   +2 more sources

Distributed Database Query Processing

1985
In a distributed database environment, it is common that queries access data from different sites. In such situations, it is reasonable to attempt to limit the amount of data transfer across sites. Many algorithms have been suggested. In this chapter we present the problems encountered in distributed query processing and some of the common techniques ...
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.
P. Bodorik, J.S. Riordon
openaire   +1 more source

Performance issues in distributed query processing

IEEE Transactions on Parallel and Distributed Systems, 1993
The authors discuss various performance issues in distributed query processing. They validate and evaluate the performance of the local reduction (LR) the fragment and replicate strategy (FRS) and the partition and replicate strategy (PRS) optimization algorithms.
C. Liu, C. Yu
openaire   +1 more source