Matches in SemOpenAlex for { <https://semopenalex.org/work/W2337762748> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2337762748 endingPage "114" @default.
- W2337762748 startingPage "114" @default.
- W2337762748 abstract "The thesis is concerned with two query processing and optimization problems in relational database systems, namely, the distributed query processing problem in broadcasting local area networks and the multiple query optimization problem. In this thesis, a systematic way is proposed to deal with these two problems. For a given query or a set of queries, a query state is defined. Each query processing operation (selection, join etc.) is treated as a query state transition. So the query optimization problem can be considered as a problem of searching for a minimum cost path from the original query state to the final query state.In the distributed query processing environment, semijoin has been used to reduce the data communication cost. For Broadcasting Local Area Networks (BLAN's), communication cost and local processing cost are comparable, semijoin may not be as useful as in long-haul networks. The conventional two-phase strategy (semijoin reduction phase and final join phase) for long-haul networks which emphasizes reducing the relation sizes before joins may not be suitable for local area networks. To deal with the problem of inaccuracy of the database statistics information and to reduce the size estimation errors, we investigate the utility of dynamic query processing methods for BLAN's. We show the advantage of dynamic strategy over static strategy for simple queries. To investigate the performances for general queries, we perform simulations and compare static and dynamic query processing methods. The simulation results show that the new algorithm is an improvement to the existing methods for distributed query processing, and dynamic strategy is superior to the static strategy when the attribute value distribution is very biased.We also study the problem of multiple query optimization. After a survey of the previous work, we propose a multiple query processing system to optimize a set of queries simultaneously. The system consists of four components: Query analyzer, Query reorganizer, Query optimizer and Query processor. Both general searching methods and heuristic methods are discussed. Two kinds of multiple operations, namely, multiple selection and multiple joins, are introduced to combine operations and further reduce the query processing costs at the physical level. (Abstract shortened with permission of author.)" @default.
- W2337762748 created "2016-06-24" @default.
- W2337762748 creator A5013424429 @default.
- W2337762748 creator A5015591193 @default.
- W2337762748 date "1988-01-01" @default.
- W2337762748 modified "2023-10-17" @default.
- W2337762748 title "On distributed query processing and multiple query optimization" @default.
- W2337762748 hasPublicationYear "1988" @default.
- W2337762748 type Work @default.
- W2337762748 sameAs 2337762748 @default.
- W2337762748 citedByCount "0" @default.
- W2337762748 crossrefType "journal-article" @default.
- W2337762748 hasAuthorship W2337762748A5013424429 @default.
- W2337762748 hasAuthorship W2337762748A5015591193 @default.
- W2337762748 hasConcept C118689300 @default.
- W2337762748 hasConcept C120314980 @default.
- W2337762748 hasConcept C124101348 @default.
- W2337762748 hasConcept C157692150 @default.
- W2337762748 hasConcept C164120249 @default.
- W2337762748 hasConcept C172722865 @default.
- W2337762748 hasConcept C192028432 @default.
- W2337762748 hasConcept C192939062 @default.
- W2337762748 hasConcept C199360897 @default.
- W2337762748 hasConcept C23123220 @default.
- W2337762748 hasConcept C24028149 @default.
- W2337762748 hasConcept C2778692605 @default.
- W2337762748 hasConcept C41008148 @default.
- W2337762748 hasConcept C70061542 @default.
- W2337762748 hasConcept C97854310 @default.
- W2337762748 hasConcept C99016210 @default.
- W2337762748 hasConceptScore W2337762748C118689300 @default.
- W2337762748 hasConceptScore W2337762748C120314980 @default.
- W2337762748 hasConceptScore W2337762748C124101348 @default.
- W2337762748 hasConceptScore W2337762748C157692150 @default.
- W2337762748 hasConceptScore W2337762748C164120249 @default.
- W2337762748 hasConceptScore W2337762748C172722865 @default.
- W2337762748 hasConceptScore W2337762748C192028432 @default.
- W2337762748 hasConceptScore W2337762748C192939062 @default.
- W2337762748 hasConceptScore W2337762748C199360897 @default.
- W2337762748 hasConceptScore W2337762748C23123220 @default.
- W2337762748 hasConceptScore W2337762748C24028149 @default.
- W2337762748 hasConceptScore W2337762748C2778692605 @default.
- W2337762748 hasConceptScore W2337762748C41008148 @default.
- W2337762748 hasConceptScore W2337762748C70061542 @default.
- W2337762748 hasConceptScore W2337762748C97854310 @default.
- W2337762748 hasConceptScore W2337762748C99016210 @default.
- W2337762748 hasLocation W23377627481 @default.
- W2337762748 hasOpenAccess W2337762748 @default.
- W2337762748 hasPrimaryLocation W23377627481 @default.
- W2337762748 hasRelatedWork W1844678091 @default.
- W2337762748 hasRelatedWork W1971797742 @default.
- W2337762748 hasRelatedWork W1996948980 @default.
- W2337762748 hasRelatedWork W2011795509 @default.
- W2337762748 hasRelatedWork W2098924054 @default.
- W2337762748 hasRelatedWork W2109081159 @default.
- W2337762748 hasRelatedWork W2348207178 @default.
- W2337762748 hasRelatedWork W2362279969 @default.
- W2337762748 hasRelatedWork W2362665752 @default.
- W2337762748 hasRelatedWork W2371708674 @default.
- W2337762748 hasRelatedWork W2378560543 @default.
- W2337762748 hasRelatedWork W2386168435 @default.
- W2337762748 hasRelatedWork W2387217164 @default.
- W2337762748 hasRelatedWork W2800798464 @default.
- W2337762748 hasRelatedWork W2958179271 @default.
- W2337762748 hasRelatedWork W3093354955 @default.
- W2337762748 hasRelatedWork W71093527 @default.
- W2337762748 hasRelatedWork W82510560 @default.
- W2337762748 hasRelatedWork W2566063947 @default.
- W2337762748 hasRelatedWork W2825443991 @default.
- W2337762748 isParatext "false" @default.
- W2337762748 isRetracted "false" @default.
- W2337762748 magId "2337762748" @default.
- W2337762748 workType "article" @default.