標(biāo)題: Titlebook: Advances in Database Technology - EDBT ‘98; 6th International Co Hans-J?rg Schek,Gustavo Alonso,Isidro Ramos Conference proceedings 1998 Sp [打印本頁] 作者: Sediment 時間: 2025-3-21 19:57
書目名稱Advances in Database Technology - EDBT ‘98影響因子(影響力)
書目名稱Advances in Database Technology - EDBT ‘98影響因子(影響力)學(xué)科排名
書目名稱Advances in Database Technology - EDBT ‘98網(wǎng)絡(luò)公開度
書目名稱Advances in Database Technology - EDBT ‘98網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Database Technology - EDBT ‘98被引頻次
書目名稱Advances in Database Technology - EDBT ‘98被引頻次學(xué)科排名
書目名稱Advances in Database Technology - EDBT ‘98年度引用
書目名稱Advances in Database Technology - EDBT ‘98年度引用學(xué)科排名
書目名稱Advances in Database Technology - EDBT ‘98讀者反饋
書目名稱Advances in Database Technology - EDBT ‘98讀者反饋學(xué)科排名
作者: 我正派 時間: 2025-3-21 20:30 作者: 神圣在玷污 時間: 2025-3-22 02:01 作者: Tartar 時間: 2025-3-22 05:12 作者: 種屬關(guān)系 時間: 2025-3-22 09:10 作者: VOK 時間: 2025-3-22 15:39
Improving the query performance of high-dimensional index structures by bulk load operations, unique, especially generated statistical section covering tThorvald Stoltenberg Ambassador Chairman of the Editorial Advisory Board A.5 the second volume of the this yearbook goes to press, Europe faces new and to some degree unexpected dangers of political and ideological division. It is a frighte作者: tenosynovitis 時間: 2025-3-22 17:54 作者: Pantry 時間: 2025-3-22 23:06 作者: 使聲音降低 時間: 2025-3-23 02:14 作者: 協(xié)奏曲 時間: 2025-3-23 07:13
Sally A. Amundson,Albert J. Fornace Jr. systems. We show how to efficiently find good query plans within this large class. We provide additional heuristics that, by considering plans outside our target class of plans, yield further performance improvements.作者: 斷言 時間: 2025-3-23 12:14
Regulation of CDKs by phosphorylation,des a clear separation between practical and conceptual aspects. In this framework, we present a design methodology, to obtain an . scheme from an operational database. We then show how an . database can be implemented, describing translations into relational tables and into multidimensional arrays.作者: COM 時間: 2025-3-23 15:26
0302-9743 essing and storage management, aggregation and summary data, object-oriented and active databases, view maintenance and integrity, databases and the Web, workflow and scientific databases.978-3-540-64264-0978-3-540-69709-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: headlong 時間: 2025-3-23 18:09
Howard B. Lieberman,Kevin M. Hopkins is based on an open world assumption, but allows for predicate-specific closed world assumptions. For performing efficient retrieval on large databases, our system provides access to external data. We demonstrate the application of HySpirit by giving examples for retrieval on images, structured documents and large databases.作者: coddle 時間: 2025-3-24 02:06
Methods to Induce Cell Cycle Checkpointsonstraints that capture the redundancies in the site. We map relational views of a site to a navigational algebra and show how to use the constraints to rewrite algebraic expressions, reducing the number of network accesses.作者: 賠償 時間: 2025-3-24 04:38 作者: BUDGE 時間: 2025-3-24 10:01
https://doi.org/10.1007/978-1-0716-1217-0erefore, users need not to know the existence and definition of MAV in order to share materialized data. Incremental update of MAV created from single base table is also considered. The application of MAV to data mining is presented to illustrate the use of multivariate and multidimensional OLAP.作者: 察覺 時間: 2025-3-24 12:25 作者: 輕快來事 時間: 2025-3-24 16:51
Tong Li,Yannick Gachet,Sylvie Tournieriques that includes those proposed for the network. The results demonstrate that a new class of disk scheduling techniques, termed ..., is superior. Algorithms used to represent this class were adopted from the networking literature.作者: Derogate 時間: 2025-3-24 21:41
https://doi.org/10.1007/978-1-4939-0888-2eplacement. The knowledge to be discovered and the discovery algorithms are discussed. The effectiveness of the proposed approach was investigated through a simulation study. The results indicate that with the help of the discovered knowledge, the public buffer hit ratio can be improved significantly.作者: FLACK 時間: 2025-3-25 01:21 作者: 一大群 時間: 2025-3-25 03:21
Migadlisel Colòn,Nancy C. Walworthmortized time is .(log..+log..+1/.log...), where . is the size of the query result, and ... is a small constant, representing the number of times we must repeatedly apply the log. function to . before the result becomes ≤ 2.作者: bisphosphonate 時間: 2025-3-25 08:03 作者: 國家明智 時間: 2025-3-25 12:39 作者: 出汗 時間: 2025-3-25 18:24
Amanda S. Brooker,Karen M. Berkowitzmpute multiple aggregate queries in data cubes on a shared-nothing multiprocessor with high-bandwidth communication facilities. We evaluate the algorithms on the basis of analytical modeling and an implementation on an IBM SP2 system.作者: Allergic 時間: 2025-3-25 21:56 作者: labile 時間: 2025-3-26 00:57
On the ubiquity of information services and the absence of guaranteed service quality,978-0-230-37184-2作者: Dorsal 時間: 2025-3-26 05:40 作者: 嗎啡 時間: 2025-3-26 10:20
,HySpirit — A probabilistic inference engine for hypermedia retrieval in large databases,978-0-230-11640-5作者: intuition 時間: 2025-3-26 13:12
Pincer-search: A new algorithm for discovering the maximum frequent set,978-0-230-58944-5作者: Serenity 時間: 2025-3-26 17:03
Incremental generalization for mining in a data warehousing environment,978-0-230-51084-5作者: 傲慢物 時間: 2025-3-26 22:43
An evaluation of alternative disk scheduling techniques in support of variable bit rate continuous 978-3-642-58337-7作者: Chagrin 時間: 2025-3-27 03:36 作者: 痛苦一生 時間: 2025-3-27 07:09 作者: 道學(xué)氣 時間: 2025-3-27 10:18 作者: 暫時過來 時間: 2025-3-27 14:06
Complex aggregation at multiple granularities,ion taking place via an information system, such an agreement is called a "grammar" or a "conceptual schemea" of this information system. "Information analysis" is that field and also that phase of development of an information system in which the grammar or the conceptual schemea of the information作者: tattle 時間: 2025-3-27 20:14
Jacob W. P. Keeling,Rita K. Millerch is used only for maintaining and updating a new data structure we designed, the maximum frequent candidate set. It is used to prune candidates in the bottom-up search. A very important characteristic of the algorithm is that it does not require explicite examination of every frequent itemset. The作者: 悠然 時間: 2025-3-28 01:02
Jongkuen Lee,David Dominguez-Solaperiments demonstrate that incremental generalization can be performed efficiently at a low degree of overly generalization. Furthermore, an optimal cardinality for the sets of updates can be determined experimentally yielding the best efficiency.作者: 箴言 時間: 2025-3-28 03:21 作者: thrombus 時間: 2025-3-28 06:49
Tong Li,Yannick Gachet,Sylvie Tournier%-quantile, results in a bad query performance in high-dimensional spaces. Therefore, we use a sophisticated unbalanced split strategy, which leads to a much better space partitioning. An exhaustive experimental evaluation shows that our technique clearly outperforms both classic index construction 作者: 危機(jī) 時間: 2025-3-28 12:16
Eishi Noguchi,Mariana C. Gadaletaportant because, as we show, existing datacube evaluation algorithms can be used to compute multi-feature cubes that are distributive or algebraic, without any increase in I/O complexity. We evaluate the CPU performance of computing multi-feature cubes using the datacube evaluation algorithm of Ross作者: 項目 時間: 2025-3-28 16:11 作者: 拔出 時間: 2025-3-28 19:42
Equal time for data on the internet with websemantics,general readers will find here an interesting study with implications far beyond statistics.? The development of statistical inference, to its present position of prominence in the social sciences, epitomizes a978-3-030-73259-2978-3-030-73257-8作者: 高談闊論 時間: 2025-3-29 02:28 作者: 彎彎曲曲 時間: 2025-3-29 04:54 作者: 王得到 時間: 2025-3-29 08:28
Improving the query performance of high-dimensional index structures by bulk load operations,imilar conflicts in the future and how to overcome mutual recriminations so that they do not harden into new political front lines between East and West in Europe. The recent developments make the promotion of 978-3-642-57127-5作者: 洞穴 時間: 2025-3-29 15:18 作者: 樹上結(jié)蜜糖 時間: 2025-3-29 16:17
Advances in Database Technology - EDBT ‘98978-3-540-69709-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Glaci冰 時間: 2025-3-29 19:58
Cell Culture in the Neurosciencesant case where . similarity queries are defined through a generic language . and whose predicates refer to a single feature .. Contrary to the language level which deals only with similarity scores, the proposed evaluation process is based on distances between feature values — known spatial or metri作者: BARK 時間: 2025-3-30 03:21 作者: aphasia 時間: 2025-3-30 04:28 作者: Subdue 時間: 2025-3-30 08:51
Sally A. Amundson,Albert J. Fornace Jr.ssing of fusion queries. First, we focus on a very wide class of query plans that capture the spirit of many techniques usually considered in existing systems. We show how to efficiently find good query plans within this large class. We provide additional heuristics that, by considering plans outsid作者: CLIFF 時間: 2025-3-30 15:55
Methods to Induce Cell Cycle Checkpointsuerying these views efficiently requires new techniques. Data usually resides at a remote site and is organized as a set of related HTML documents, with network access being a primary cost factor in query evaluation. This cost can be reduced by exploiting the redundancy often found in site design. W作者: 執(zhí) 時間: 2025-3-30 17:32
Claudia Tapia-Alveal,Matthew J. O’Connellndard for data exchange, i.e., a standard schema and its semantics. However, sharing this data among a global community of users is still difficult because of a lack of standards for the following necessary functions: (i) data providers need a standard for describing or publishing available sources 作者: 大溝 時間: 2025-3-30 22:38 作者: Etching 時間: 2025-3-31 02:34 作者: Enrage 時間: 2025-3-31 06:46
Jongkuen Lee,David Dominguez-Solaering, classification and summarization. Attribute-oriented generalization is a common method for the task of summarization. Typically, in a data warehouse update operations are collected and applied to the data warehouse periodically. Then, all derived information has to be updated as well. Due to 作者: Obsequious 時間: 2025-3-31 10:40 作者: 不自然 時間: 2025-3-31 14:06
A. Bürgin,C. Bouchard,M. Eilersstems support hypothesis-driven exploration of data cubes through operations such as drill-down, roll-up, and selection. Using these operations, an analyst navigates unaided through a huge search space looking at large number of values to spot exceptions. We propose a new discovery-driven exploratio作者: 相符 時間: 2025-3-31 20:48 作者: cylinder 時間: 2025-4-1 01:00
Regulation of CDKs by phosphorylation,ore, several researchers have proposed algorithms to compute optimal processing trees for queries with expensive predicates. All these approaches are incorrect—with one exception [3]. Our contribution is as follows. We present a formally derived and correct dynamic programming algorithm to compute o作者: 惹人反感 時間: 2025-4-1 05:21
Tong Li,Yannick Gachet,Sylvie Tournierems. Since it is very inefficient to construct an index for a large amount of data by dynamic insertion of single objects, there is an increasing interest in bulk-loading techniques. In contrast to previous approaches, our technique exploits a priori knowledge of the complete data set to improve bot作者: 發(fā)現(xiàn) 時間: 2025-4-1 08:29
Tong Li,Yannick Gachet,Sylvie TournierCBR) video, VBR has a lower storage and bandwidth requirement while providing the same quality of images. However, a VBR video clip might exhibit a significant variance in the bit rate required to support its continuous display. The previous studies have proposed techniques to support the display of作者: Lime石灰 時間: 2025-4-1 11:28
https://doi.org/10.1007/978-1-4939-0888-2d into two areas: public and private. While the private buffer areas contain pages to be updated by particular users, the public buffer area contains pages shared among users from different sites. Different from traditional buffer management strategies where limited knowledge of user access patterns作者: glomeruli 時間: 2025-4-1 16:45
Eishi Noguchi,Mariana C. Gadaletalex subquery involving multiple dependent aggregates at multiple granularities. We call such queries “multi-feature cubes.” An example is “Broken down by all combinations of month and customer, find the fraction of the total sales in 1996 of a particular item due to suppliers supplying within 10% of作者: Adjourn 時間: 2025-4-1 21:10 作者: 強(qiáng)化 時間: 2025-4-1 22:51
https://doi.org/10.1007/BFb0100972Fusion; OLAP; Processing; Scala; algorithms; data warehouse; database; inference engine; information system; 作者: 媽媽不開心 時間: 2025-4-2 04:12
978-3-540-64264-0Springer-Verlag Berlin Heidelberg 1998作者: tariff 時間: 2025-4-2 09:24 作者: DOLT 時間: 2025-4-2 14:27
