標(biāo)題: Titlebook: Database Machines; Sixth International Haran Boral,Pascal Faudemay Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 Date [打印本頁] 作者: 召集會議 時(shí)間: 2025-3-21 19:58
書目名稱Database Machines影響因子(影響力)
書目名稱Database Machines影響因子(影響力)學(xué)科排名
書目名稱Database Machines網(wǎng)絡(luò)公開度
書目名稱Database Machines網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Machines被引頻次
書目名稱Database Machines被引頻次學(xué)科排名
書目名稱Database Machines年度引用
書目名稱Database Machines年度引用學(xué)科排名
書目名稱Database Machines讀者反饋
書目名稱Database Machines讀者反饋學(xué)科排名
作者: 死貓他燒焦 時(shí)間: 2025-3-21 22:44
,Design and implementation of KARDAMOM — A set-oriented data flow database machine,arallel algorithms for relational operations. Other crucial issues in such systems include communication between the software modules of the database management system which are distributed across the processors and efficient control of parallel query execution. In this paper, we argue that strictly作者: 減至最低 時(shí)間: 2025-3-22 03:20 作者: 深陷 時(shí)間: 2025-3-22 05:23 作者: 抒情短詩 時(shí)間: 2025-3-22 11:56
,A graph based data structure for efficient implementation of main memory DBMS’s,is organization aims two objectives: be compact and decomposable such as the active database always fits in main memory and speed up extended relational algebra in term of CPU time. Tuples and indices are integrated in a unique data structure called DBGraph. Tuples and values are stored separately a作者: Explicate 時(shí)間: 2025-3-22 15:05 作者: Explicate 時(shí)間: 2025-3-22 20:23
Database processing models in parallel processing systems, conflict free data accesses. We propose abstract models as a general framework, and then present two specific parallel processing strategies for two common types of database applications. One is optimal file distribution for partial match queries, and the other is a multidirectory hasing scheme whe作者: 流眼淚 時(shí)間: 2025-3-22 23:52
Parallel sorting methods for large data volumes on a hypercube database computer,rs. The methods are based on partitioning of data according to partition values obtained through sampling of the data. One of the algorithms which is implemented at the HC16 database computer designed at The Norwegian Institute of Technology, is described in detail together with a performance evalua作者: 橫條 時(shí)間: 2025-3-23 01:57 作者: 紅腫 時(shí)間: 2025-3-23 07:09
A parallel container model for data intensive applications,databases. A parallel model with concurrent containers storing persistent objects of the same type is proposed and discussed. Communication among the containers is through messages, which incorporate object identifiers and function abstractions. Restricting container assignment to particular types o作者: 輕觸 時(shí)間: 2025-3-23 13:33
Function request shipping in a database machine environment, which implement the transaction must somehow come to exist at the necessary sites; they must be linked and loaded; and each must be invoked by a coordinator or subordinate transaction thread. We call this mechanism function request shipping, or FRS. The primary concerns in FRS are about the code th作者: Assignment 時(shí)間: 2025-3-23 16:10 作者: Gyrate 時(shí)間: 2025-3-23 21:29 作者: 有害處 時(shí)間: 2025-3-24 00:20 作者: MARS 時(shí)間: 2025-3-24 05:13 作者: 類人猿 時(shí)間: 2025-3-24 08:37 作者: avenge 時(shí)間: 2025-3-24 14:40 作者: 不適當(dāng) 時(shí)間: 2025-3-24 15:49
An experiment on response time scalability in Bubba,s increased. We further show how these effects change under increased levels of concurrency and heterogeneity in the transaction workload. From the results, we conclude that although parallelism must be limited in some circumstances, in general the benefits of increased parallelism in shared-nothing systems exceed the costs.作者: Harrowing 時(shí)間: 2025-3-24 21:11 作者: 擁護(hù) 時(shí)間: 2025-3-24 23:49
Special function unit for statistical aggregation functions,oposed unit is considered. The performance of the proposed design is compared with the implementation of statistical aggregation functions on the parallel pipelined relational query processor described in [1]. The comparative analysis shows that our approach performs significantly better than that of [1].作者: 拉開這車床 時(shí)間: 2025-3-25 05:51 作者: 會犯錯(cuò)誤 時(shí)間: 2025-3-25 10:16 作者: guardianship 時(shí)間: 2025-3-25 15:33 作者: 軍火 時(shí)間: 2025-3-25 19:16
Conference proceedings 1989g: system architectures, storage structures, associative memory architectures, memory resident systems, deduction and retrospectives on maturing projects. The nature of the papers is highly technical and presumes knowledge of database management systems and familiarity with database machines. The bo作者: Vulnerable 時(shí)間: 2025-3-25 22:38
0302-9743 s including: system architectures, storage structures, associative memory architectures, memory resident systems, deduction and retrospectives on maturing projects. The nature of the papers is highly technical and presumes knowledge of database management systems and familiarity with database machin作者: Criteria 時(shí)間: 2025-3-26 01:22 作者: 不滿分子 時(shí)間: 2025-3-26 06:29
Giuseppe Giordan,Marco Guglielmicontainers is through messages, which incorporate object identifiers and function abstractions. Restricting container assignment to particular types of objects (shared objects and set elements) is also discussed. Finally, the model is extended to incorporate result containers and container message variables.作者: Pamphlet 時(shí)間: 2025-3-26 11:22
https://doi.org/10.1007/978-1-4613-2077-7t also processes classical relational operations and deductive operations in a uniform way. We present here a general overview of the accelerator and we focus on the language levels and the computational model.作者: Ophthalmologist 時(shí)間: 2025-3-26 12:44 作者: invert 時(shí)間: 2025-3-26 20:16 作者: 話 時(shí)間: 2025-3-27 00:35 作者: grudging 時(shí)間: 2025-3-27 02:41
Language levels and computational model for a parallel database accelerator,t also processes classical relational operations and deductive operations in a uniform way. We present here a general overview of the accelerator and we focus on the language levels and the computational model.作者: peptic-ulcer 時(shí)間: 2025-3-27 08:53 作者: curriculum 時(shí)間: 2025-3-27 09:27
Function request shipping in a database machine environment,cution: piggyback, callback, and shared disk. The performance of these mechanisms, with and without code caching, was measured on the ARBRE prototype. The results indicate that the method of choice depends on both the cache hit ratio and the size of the code fragments.作者: transdermal 時(shí)間: 2025-3-27 15:27 作者: 招人嫉妒 時(shí)間: 2025-3-27 17:58 作者: 使堅(jiān)硬 時(shí)間: 2025-3-27 23:11 作者: growth-factor 時(shí)間: 2025-3-28 04:02
Conference proceedings 1989cts. The nature of the papers is highly technical and presumes knowledge of database management systems and familiarity with database machines. The book is representative of the dual trend in the field towards (1) search for new functionability and (2) attention to detail, completeness and performance of prototype implementations.作者: 北極熊 時(shí)間: 2025-3-28 06:25
E. H. Sonnenblick,T. H. Lejemtels increased. We further show how these effects change under increased levels of concurrency and heterogeneity in the transaction workload. From the results, we conclude that although parallelism must be limited in some circumstances, in general the benefits of increased parallelism in shared-nothing systems exceed the costs.作者: heckle 時(shí)間: 2025-3-28 11:47 作者: 協(xié)迫 時(shí)間: 2025-3-28 17:20 作者: OVER 時(shí)間: 2025-3-28 19:57
Southampton Studies in International Policyn parallel. Performance of the DPPM has been evaluated both analytically and experimentally. Based on the simulation statistics and timing analysis on the hardware prototype, a search rate of multiple gigabytes per second is achievable using 2 μm CMOS technology.作者: 滔滔不絕的人 時(shí)間: 2025-3-29 02:19 作者: inundate 時(shí)間: 2025-3-29 04:19 作者: 改革運(yùn)動 時(shí)間: 2025-3-29 08:49
Generic associative memory for information retrieval,l operations are explored. This associative memory can perform parallel search for multi-word strings or records, and then retrieve any number of pointers or data. It can be used as a standard RAM for random read/write operations, and as a conventional associative memory for relational search and pattern matching.作者: deface 時(shí)間: 2025-3-29 14:23
Integrating integrity constraints with database filters implemented in hardware,adened to include data-base integrity constraints. The constraints are formalized in canonical forms. Several filter simplification techniques are described, and finally a filtering hardware architecture is presented.作者: POLYP 時(shí)間: 2025-3-29 16:57 作者: V洗浴 時(shí)間: 2025-3-29 23:30
https://doi.org/10.1007/978-3-030-97862-4We consider a hypothetical database machine in which the main memory is non-volatile, and present recovery algorithms for such a machine. These algorithms are considerably simpler and more efficient than classical recovery algorithms.作者: 言外之意 時(shí)間: 2025-3-30 00:03
Main memory database research directions,The state of MMDB research with respect to some of the many unsolved problems is investigated. For MMDB systems to realize their full performance potential, the issues raised here must be addressed. We hope that this discussion will increase interest in main memory systems and stimulate future research activities.作者: encyclopedia 時(shí)間: 2025-3-30 06:22 作者: 旅行路線 時(shí)間: 2025-3-30 09:50 作者: Exposure 時(shí)間: 2025-3-30 14:04
Giuseppe Giordan,Marco Guglielmirs. The methods are based on partitioning of data according to partition values obtained through sampling of the data. One of the algorithms which is implemented at the HC16 database computer designed at The Norwegian Institute of Technology, is described in detail together with a performance evaluation and a presentation of some test results.作者: REP 時(shí)間: 2025-3-30 17:58 作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-30 20:44
https://doi.org/10.1007/978-3-030-97862-4adened to include data-base integrity constraints. The constraints are formalized in canonical forms. Several filter simplification techniques are described, and finally a filtering hardware architecture is presented.作者: fledged 時(shí)間: 2025-3-31 01:01 作者: GRACE 時(shí)間: 2025-3-31 07:19
978-3-540-51324-7Springer-Verlag Berlin Heidelberg 1989作者: HERE 時(shí)間: 2025-3-31 09:26 作者: GRAVE 時(shí)間: 2025-3-31 15:25
Noninvasive Evaluation of Proarrhythmiaarallel algorithms for relational operations. Other crucial issues in such systems include communication between the software modules of the database management system which are distributed across the processors and efficient control of parallel query execution. In this paper, we argue that strictly作者: 繁榮地區(qū) 時(shí)間: 2025-3-31 21:32 作者: constitute 時(shí)間: 2025-4-1 01:20
