標題: Titlebook: Database and Expert Systems Applications; 15th International C Fernando Galindo,Makoto Takizawa,Roland Traunmülle Conference proceedings 20 [打印本頁] 作者: BRISK 時間: 2025-3-21 19:52
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學科排名
作者: Biofeedback 時間: 2025-3-21 20:52
Autonomic Group Protocol for Peer-to-Peer (P2P) Systemsunction. Classes taken by an agent are required to be consistent with but might be different from the others. We make clear what combination of classes can be autonomously taken by agents. We also present how to change retransmission ways.作者: 凹室 時間: 2025-3-22 00:29 作者: Diaphragm 時間: 2025-3-22 05:46
Contributions to Probability and Statisticsoposed for query containment checking) to verify whether these properties hold for a given database schema. Our aim is to define an effective and efficient method as the starting point to develop a practical tool for validating database schemas in commercial DBMSs.作者: 圖表證明 時間: 2025-3-22 11:38 作者: badinage 時間: 2025-3-22 15:59
Friedrich Keune,Klaus Oswatitsch represented as Cases. In searching for better solutions, the system can also interact with the Database Administrator. The main functionalities provided are failure prediction and adaptation of problem – solving capabilities through the chosen learning mechanism.作者: badinage 時間: 2025-3-22 20:52 作者: Crumple 時間: 2025-3-22 21:36 作者: 放肆的你 時間: 2025-3-23 01:23 作者: 江湖郎中 時間: 2025-3-23 07:25
Gerhard H. Fischer,Donald Lamingil to address how to ensure task dependencies during workflow recovery. In this paper, we consider the workflow recovery problem and propose a recovery scheme that ensures the satisfaction of dependencies in a workflow and restores consistency as well.作者: bizarre 時間: 2025-3-23 11:46
https://doi.org/10.1007/3-7643-7401-2 This paper describes such an algorithm that optimizes the temporal constraints associated with (composite) events and improves the efficiency of the databases by creating and destroying triggers dynamically such that the semantics of the event is unchanged. The efficiency of the technique is validated by our experimental results.作者: certain 時間: 2025-3-23 14:53
Studies in Computational Intelligencelysis operators. Data are then processed by the program mpropre (Managing PaRtially Ordered PREferences) that provides in output one or several optimal parcels. Results are finally validated by an expert and using ortho-images of the geographic area of interest.作者: THE 時間: 2025-3-23 18:33 作者: 原來 時間: 2025-3-23 22:45
Friedrich Keune,Klaus Oswatitsching machinery that continually scans market data and general financial news feeds. The middle-ware in this environment is based onpowerful multiagent technology that manages all processes including the information delivery and data mining. The investigation ofnetwork evolution leads to the development of “network mining” techniques.作者: Anemia 時間: 2025-3-24 04:08
An Ontology-Driven Process Modeling Frameworkanalyzing process models, such as consistency checking, interactive ontology navigation, automatic (re)discovering of process models. A software architecture fully supporting our framework is also presented and discussed.作者: defuse 時間: 2025-3-24 10:02
Ensuring Task Dependencies During Workflow Recoveryil to address how to ensure task dependencies during workflow recovery. In this paper, we consider the workflow recovery problem and propose a recovery scheme that ensures the satisfaction of dependencies in a workflow and restores consistency as well.作者: tackle 時間: 2025-3-24 14:08 作者: mortuary 時間: 2025-3-24 15:35 作者: Noisome 時間: 2025-3-24 21:35 作者: 手段 時間: 2025-3-25 03:09 作者: Tremor 時間: 2025-3-25 06:07 作者: 異教徒 時間: 2025-3-25 09:53 作者: 我邪惡 時間: 2025-3-25 14:31
https://doi.org/10.1007/978-3-319-34081-4 each version may vary in both content and structure, at any level of granularity. Further, the system ensures that clients may listen to structured, minimal changes in . of encoded entities, as they occur, whenever any change is made to the total entity encoded in the database.作者: 推延 時間: 2025-3-25 16:50
Reinhard K?hler,Burghard B. Riegers of the same workflow schema. An evolution architecture is proposed, in order to separate the involved concepts in a set of managers. Two of these managers are discussed in this paper – Version Manager and Modification Manager.作者: ABHOR 時間: 2025-3-25 22:51
Contributions to Quantitative Linguisticsn optimal way of using the bitmap indices to reduce the number of pages accessed. Compared with two basic strategies the new algorithm reduces the query response time by up to a factor of two. On a set of 5-dimensional queries on real application data, the bitmap indices are on average 10 times faster than the projection index.作者: 后退 時間: 2025-3-26 04:08 作者: FAWN 時間: 2025-3-26 06:56 作者: 飾帶 時間: 2025-3-26 10:45
Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databasess, allow to restrict the number of repairs and to increase the power of queries over inconsistent databases. Moreover, it is studied the complexity of computing repairs and the expressive power of relational queries over databases with integrity constraints, feasibility conditions and preference criteria.作者: 吵鬧 時間: 2025-3-26 15:25
An Active Functional Intensional Database each version may vary in both content and structure, at any level of granularity. Further, the system ensures that clients may listen to structured, minimal changes in . of encoded entities, as they occur, whenever any change is made to the total entity encoded in the database.作者: FEAS 時間: 2025-3-26 20:04 作者: Largess 時間: 2025-3-26 23:16
Evaluation Strategies for Bitmap Indices with Binningn optimal way of using the bitmap indices to reduce the number of pages accessed. Compared with two basic strategies the new algorithm reduces the query response time by up to a factor of two. On a set of 5-dimensional queries on real application data, the bitmap indices are on average 10 times faster than the projection index.作者: Calibrate 時間: 2025-3-27 02:14
An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Networkic neighbor searching algorithm to locate potential neighbors of the active users in order to reduce the network traffic and executive cost. The experimental data show that our DCF algorithm with the neighbor searching scheme has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy.作者: 拋媚眼 時間: 2025-3-27 09:08
Web Service Based Architecture for Workflow Management Systems Web service technology. With provision of a novel agreement management service and an enhanced definition template library, this architecture offers full support to business process collaborations among participating organisations, including both the horizontal and vertical partitioning schemes.作者: 尊敬 時間: 2025-3-27 09:48 作者: Palpate 時間: 2025-3-27 16:14 作者: 謙虛的人 時間: 2025-3-27 21:23 作者: 搏斗 時間: 2025-3-28 00:28 作者: GRE 時間: 2025-3-28 03:18
Klaus Oswatitsch,Sune B. Berndtt nodes will be accessed. Use of our growing node policy has the following advantages: (i) it can have the effect of a delayed split that does not depend on the insertion order, and (ii) it can reduce the number of generated nodes and the height of the tree.作者: nitroglycerin 時間: 2025-3-28 06:46
Conference proceedings 2004 contributed to it; they are the real base of the conference. The program committee and the supporting reviewers produced altogether 942 referee reports, in average 3,1 reports per paper, and selected 92 papers for presentation. At this point we would like to say many thanks to all the institutions 作者: chemoprevention 時間: 2025-3-28 14:15
Fernando Galindo,Makoto Takizawa,Roland Traunmülle作者: 膽大 時間: 2025-3-28 18:01 作者: Proclaim 時間: 2025-3-28 20:34 作者: gentle 時間: 2025-3-29 00:49
0302-9743 eree reports, in average 3,1 reports per paper, and selected 92 papers for presentation. At this point we would like to say many thanks to all the institutions 978-3-540-22936-0978-3-540-30075-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: atopic 時間: 2025-3-29 04:43 作者: paltry 時間: 2025-3-29 09:37
An Ontology-Driven Process Modeling Frameworkess (re-)engineering, Web/grid computing. In this paper, we propose a framework that supports the designer in the definition and in the analysis of complex processes by means of several facilities for reusing, customizing and generalizing existent process components. To this aim we tightly integrate作者: 防水 時間: 2025-3-29 12:44 作者: SMART 時間: 2025-3-29 18:34 作者: Recess 時間: 2025-3-29 20:52
Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databasesases which do not satisfy integrity constraints. In the presence of inconsistencies two main techniques have been proposed: compute repairs, i.e. minimal set of insertion and deletion operations, called ., and compute ., i.e. identify the sets of atoms which we can assume true, false and undefined w作者: 草率女 時間: 2025-3-30 00:07 作者: 透明 時間: 2025-3-30 06:29 作者: Anthem 時間: 2025-3-30 11:56 作者: 包租車船 時間: 2025-3-30 16:01 作者: Palatial 時間: 2025-3-30 19:55 作者: 使苦惱 時間: 2025-3-30 21:43 作者: 受辱 時間: 2025-3-31 01:12
Evaluation Strategies for Bitmap Indices with Binningices on attributes with high cardinalities, we present a new strategy to evaluate queries using bitmap indices. This work is motivated by a number of scientific data analysis applications where most attributes have cardinalities in the millions. On these attributes, binning is a common strategy to r作者: Dorsal-Kyphosis 時間: 2025-3-31 08:47 作者: 發(fā)誓放棄 時間: 2025-3-31 11:53 作者: amygdala 時間: 2025-3-31 14:44 作者: Constitution 時間: 2025-3-31 20:12 作者: 詞匯表 時間: 2025-3-31 21:46
DBSitter: An Intelligent Tool for Database Administration, we propose a novel alternative approac h to this task, which unifies two Artificial Intelligence techniques: Case Based Reasoning and Intelligent Agents. Our prototype, DBSitter, consists of a Multi-agent system for automatic monitoring and fault correcting in a relational DBMS, where problems are作者: 使入迷 時間: 2025-4-1 03:33
Interacting with Electronic Institutions immersive, distributed virtual trading environment has been constructed. That environment is described here. Virtual worlds technology provides an immersive environment inwhich traders are represented as avatars that interact with each other, and have access to market data and general information t作者: Merited 時間: 2025-4-1 09:05
Growing Node Policies of a Main Memory Index Structure for Moving Objects Databases data, CSB+-tree eliminated pointers to pack more entries in a node, and in multi-dimensional data, CR-tree compressed MBRs in order to increase utilization of the L2 cache line. Previous studies used a fixed node size that is a multiple of the cache line size. If a node overflows, it splits , regar作者: 吹牛大王 時間: 2025-4-1 11:14 作者: 刪除 時間: 2025-4-1 14:36
