標(biāo)題: Titlebook: Advances in Databases and Information Systems; 15th International C Johann Eder,Maria Bielikova,A Min Tjoa Conference proceedings 2011 Spri [打印本頁(yè)] 作者: intern 時(shí)間: 2025-3-21 18:33
書目名稱Advances in Databases and Information Systems影響因子(影響力)
書目名稱Advances in Databases and Information Systems影響因子(影響力)學(xué)科排名
書目名稱Advances in Databases and Information Systems網(wǎng)絡(luò)公開(kāi)度
書目名稱Advances in Databases and Information Systems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Advances in Databases and Information Systems被引頻次
書目名稱Advances in Databases and Information Systems被引頻次學(xué)科排名
書目名稱Advances in Databases and Information Systems年度引用
書目名稱Advances in Databases and Information Systems年度引用學(xué)科排名
書目名稱Advances in Databases and Information Systems讀者反饋
書目名稱Advances in Databases and Information Systems讀者反饋學(xué)科排名
作者: capsaicin 時(shí)間: 2025-3-21 22:03
Revisiting the Partial Data Cube Materializationpossible to imagine a more comprehensive view of the subject, most readers – even specialists in the subject – will find that there are elements of the Gothic genre here of which they were previously unaware.”..-????????????? Barry Forshaw., Author of .British Gothic Cinema. and Sex and Film..?..The作者: 辮子帶來(lái)幫助 時(shí)間: 2025-3-22 00:23 作者: bronchiole 時(shí)間: 2025-3-22 04:56
Real-Time Computation of Advanced Rules in OLAP Databasesly renowned expert on corporate social responsibility, and S.Corporate Social Responsibility is more crucial now than ever, as society as a whole responds to challenges on a global scale - from the continuing strife nationalism causes to international supply chains, to the problems posed by the clim作者: 幼兒 時(shí)間: 2025-3-22 09:11 作者: 確定方向 時(shí)間: 2025-3-22 13:15 作者: Etching 時(shí)間: 2025-3-22 19:45 作者: obviate 時(shí)間: 2025-3-22 21:59 作者: Gingivitis 時(shí)間: 2025-3-23 01:28 作者: 許可 時(shí)間: 2025-3-23 05:40 作者: Between 時(shí)間: 2025-3-23 12:39 作者: 性冷淡 時(shí)間: 2025-3-23 15:29 作者: 同時(shí)發(fā)生 時(shí)間: 2025-3-23 20:42 作者: OVER 時(shí)間: 2025-3-23 22:52
Emergence, Complexity and Computationto traditional DBMSs. This allows us to utilize all the query optimization techniques available in the underlying DBMS. This paper surveys current approaches to rewriting-based query answering of ontological databases.作者: Adherent 時(shí)間: 2025-3-24 05:32 作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-24 06:33 作者: hemophilia 時(shí)間: 2025-3-24 14:19
Turing Patterns and Excitable Media than points in multidimensional space. Our approach allows an efficient transformation of interval queries into regions of data that results in significant improvements when accessing the data. A detailed empirical study demonstrates that the proposed method outperforms the best available off-the-shelf methods for accessing multidimensional data.作者: Antimicrobial 時(shí)間: 2025-3-24 15:34 作者: AVOW 時(shí)間: 2025-3-24 21:41
0302-9743 ions on query processing; data warehousing; DB systems; spatial data; information systems; physical DB design; evolution, integrity, security; and data semantics.978-3-642-23736-2978-3-642-23737-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 反感 時(shí)間: 2025-3-25 00:53 作者: 不可侵犯 時(shí)間: 2025-3-25 04:38 作者: 偏狂癥 時(shí)間: 2025-3-25 11:00 作者: Keshan-disease 時(shí)間: 2025-3-25 15:12 作者: heart-murmur 時(shí)間: 2025-3-25 18:41
Turing Patterns and Excitable Mediaen structure). We demonstrate performance results (I/O efficiency and execution time) of extensive experimentation that was based on real datasets, using these two index structures. The winner depends on several parameters and the results show that the xBR-tree is a promising alternative for these spatial operations.作者: 抑制 時(shí)間: 2025-3-25 23:12 作者: 緩解 時(shí)間: 2025-3-26 03:21
Conference proceedings 2011ected from 105 submissions. They are organized in topical sections on query processing; data warehousing; DB systems; spatial data; information systems; physical DB design; evolution, integrity, security; and data semantics.作者: 魔鬼在游行 時(shí)間: 2025-3-26 06:03
Cellular Automata: Research Towards Industry view: given a constraint on query evaluation, namely a maximal query cost the user does accept, find the objects (1) whose materialization needs the minimal storage space and (2) that guarantee the query evaluation constraint. We study this problem in the data cube setting and provide exact and approximate solutions.作者: congenial 時(shí)間: 2025-3-26 09:34 作者: Mingle 時(shí)間: 2025-3-26 14:38
Conference proceedings 2011 in Vienna, Austria, in September 2011. The 30 revised full papers presented together with 2 full length invited talks were carefully reviewed and selected from 105 submissions. They are organized in topical sections on query processing; data warehousing; DB systems; spatial data; information system作者: Antioxidant 時(shí)間: 2025-3-26 18:45 作者: ARIA 時(shí)間: 2025-3-26 23:47 作者: Madrigal 時(shí)間: 2025-3-27 02:48
Resource Scheduling Methods for Query Optimization in Data Grid Systemsery and compliance with legality and rights. In addition, the book draws upon the experiences of the many senior practitioners and policy-makers who participated in the research project which was funded by a major Arts and Humanities Research Council grant. This comprehensive collection is a must-re作者: 先驅(qū) 時(shí)間: 2025-3-27 08:07 作者: 嘮叨 時(shí)間: 2025-3-27 11:04
Efficient Detection of Minimal Failing Subqueries in a Fuzzy Querying Contexttional focus on organization development, training and development, and career development, this handbook adopts a more critical vantage point which classifies the scope and outcomes of HRD across five domains identified by CHRD scholars as key to understanding the nature and work of the field— orga作者: 輕浮思想 時(shí)間: 2025-3-27 15:20
MOLAP Cube Based on Parallel Scan Algorithmtries, and providing an in-depth examination of Latin?America, Africa and the Middle East)..It is aimed as a resource for a global scholarly audience looking for a detailed presentation of major.accounts of corporate social responsibility on an international scale..978-3-030-42465-7作者: BILE 時(shí)間: 2025-3-27 20:50
Real-Time Computation of Advanced Rules in OLAP Databasesg countries, and providing an in-depth examination of Latin?America, Africa and the Middle East)...?..It is aimed as a resource for a global scholarly audience looking for a detailed presentation of major accounts of corporate social responsibility on an international scale..978-3-030-22438-7作者: Anterior 時(shí)間: 2025-3-28 00:59 作者: 使?jié)M足 時(shí)間: 2025-3-28 03:48 作者: 低位的人或事 時(shí)間: 2025-3-28 08:45 作者: 巧思 時(shí)間: 2025-3-28 14:28 作者: inchoate 時(shí)間: 2025-3-28 17:05 作者: 性別 時(shí)間: 2025-3-28 21:45
Subsuming Multiple Sliding Windows for Shared Stream Computation978-3-031-47227-5作者: EXPEL 時(shí)間: 2025-3-29 00:26
Mining Preferences from OLAP Query Logs for Proactive Personalization978-1-137-29356-5作者: Bombast 時(shí)間: 2025-3-29 06:39 作者: bleach 時(shí)間: 2025-3-29 08:26
Variable Granularity Space Filling Curve for Indexing Multidimensional Data978-3-031-15854-4作者: 可憎 時(shí)間: 2025-3-29 13:40 作者: BLAND 時(shí)間: 2025-3-29 16:30 作者: STING 時(shí)間: 2025-3-29 23:41
https://doi.org/10.1007/978-3-642-23737-9XML; business information systems; data management; database queries; information retrieval; ontologies; w作者: alcoholism 時(shí)間: 2025-3-30 00:56 作者: anthesis 時(shí)間: 2025-3-30 04:40 作者: 內(nèi)閣 時(shí)間: 2025-3-30 11:42 作者: homeostasis 時(shí)間: 2025-3-30 14:53
https://doi.org/10.1007/978-94-017-1005-3 or they evaluate it bottom-up. In this paper, we present an approach that allows evaluating an XPath query in arbitrary directions, including a mixture of bottom-up and top-down direction. For each location step, it can be decided whether to evaluate it top-down or bottom-up, such that we can start作者: archetype 時(shí)間: 2025-3-30 18:37 作者: FUSC 時(shí)間: 2025-3-30 21:21 作者: Asperity 時(shí)間: 2025-3-31 04:02
Cellular Automata: Research Towards Industryblem is formalized as follows: given a set of queries and a budget e.g., an available memory space, find the objects to materialize (views and/or indexes) that (1) satisfy the given budget and (2) minimize the query cost. In this paper, we depart from this setting by adopting a user-centric point of作者: 郊外 時(shí)間: 2025-3-31 06:31 作者: 擁護(hù) 時(shí)間: 2025-3-31 09:21
Birgitt Sch?nfisch,André de Roos observations of spatial-temporal data causes the user to be not able to accurately utilise recorded information. In literature, different methods have been mentioned to clean data which fall into the category of either deterministic and probabilistic approaches. However, we believe that to ensure t作者: infringe 時(shí)間: 2025-3-31 16:44 作者: integrated 時(shí)間: 2025-3-31 19:41
Alignment and Cellular Swarmingdifferent attributes and operations such as slicing and dicing. In-memory OLAP systems keep all relevant data in main memory and also support efficient updates of cube data, enabling interactive planning, forecasting, and what-if analysis. Since usually only the base data is stored and all aggregati作者: 增強(qiáng) 時(shí)間: 2025-3-31 22:54 作者: Connotation 時(shí)間: 2025-4-1 05:10 作者: GRAIN 時(shí)間: 2025-4-1 08:29
https://doi.org/10.1007/978-1-4899-7980-3ropose different methods for RA were published. To deal with specific characteristics of the data grid systems, such as dynamicity, heterogeneity and large-scale, many studies extend classic methods from distributed and parallel databases domains. Others invite fundamentally different methods based 作者: Enteropathic 時(shí)間: 2025-4-1 12:25
Turing Patterns and Excitable Median with the database also to users with a low or moderate technical skill or in presence of huge volumes of, potentially heterogeneous, data. Recommendation is performed by extending query results with additional and potentially interesting items. Among the proposed techniques, current-state approach作者: 欺騙世家 時(shí)間: 2025-4-1 16:18 作者: EXCEL 時(shí)間: 2025-4-1 20:22
Turing Patterns and Excitable Mediamethod. For queries involving a single dataset, like the Point Location Query, the Window (Distance Range) Query, the (Constrained) K Nearest Neighbor Query, the R*-tree (a data-driven structure) is a very popular choice of such a method. In this paper, we compare the performance of the R*-tree for
