標(biāo)題: Titlebook: Database and Expert Systems Applications; 19th International C Sourav S. Bhowmick,Josef Küng,Roland Wagner Conference proceedings 2008 Spri [打印本頁] 作者: ARGOT 時(shí)間: 2025-3-21 18:51
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: transdermal 時(shí)間: 2025-3-21 23:56
Word Sense Disambiguation as the Primary Step of Ontology Integrationrder to disambiguate their meaning. This paper presents an approach to automatically disambiguating the meaning of OWL ontology classes by providing sense annotation from WordNet. A class name is disambiguated using the names of the related classes, by comparing the taxonomy of the ontology with the作者: Lyme-disease 時(shí)間: 2025-3-22 02:10 作者: 統(tǒng)治人類 時(shí)間: 2025-3-22 08:12 作者: ECG769 時(shí)間: 2025-3-22 08:55
Extending Inconsistency-Tolerant Integrity Checking by Semantic Query Optimizationic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.作者: 挑剔為人 時(shí)間: 2025-3-22 13:31 作者: 挑剔為人 時(shí)間: 2025-3-22 17:11
SQL TVF Controlling Forms - Express Structured Parallel Data Intensive Computing specifying applications functionally independent of the underlying server infrastructure, and further, by providing high-level primitives to express the control flow of applying functions to data partitions. Currently only few such primitives, e.g. Map-Reduce and Cross-Apply, are available, and the作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-22 23:28 作者: Excitotoxin 時(shí)間: 2025-3-23 03:57 作者: Coterminous 時(shí)間: 2025-3-23 09:02 作者: exostosis 時(shí)間: 2025-3-23 13:46 作者: 現(xiàn)暈光 時(shí)間: 2025-3-23 15:29 作者: Hypomania 時(shí)間: 2025-3-23 21:45 作者: Anticoagulant 時(shí)間: 2025-3-23 22:13 作者: optic-nerve 時(shí)間: 2025-3-24 04:07
On the Evaluation of Large and Sparse Graph Reachability Queriesbgraph of .. The size of that subgraph is bounded by O(.), where .is the number of all the non-tree edges. The query time of Core-I is bounded by O(log.). The Core-II labeling scheme has constant query time, but the labeling time is increased to O(.?+?.?+?.·.·.).作者: Accommodation 時(shí)間: 2025-3-24 10:26
SQL TVF Controlling Forms - Express Structured Parallel Data Intensive Computingplying Table Valued Functions (TVFs) to multiple data partitions. We further support the extensibility of this framework by allowing new FCFs to be defined from existing ones with SQL phrases. Based on this approach, we provided a SQL based high-level interface for “structured parallel computing” in作者: Project 時(shí)間: 2025-3-24 11:00
Tracking Moving Objects in Anonymized Trajectoriesl method that transforms the tracking problem into a min-cost max-flow problem. We then utilize well-known graph algorithms that work in polynomial time with respect to the number of objects. The experimental results indicate that the proposed methods produce high quality results that are comparable作者: 繞著哥哥問 時(shí)間: 2025-3-24 17:39 作者: MIRTH 時(shí)間: 2025-3-24 22:30
Oswaldo Luiz do Valle Costa,Fran?ois Dufourbgraph of .. The size of that subgraph is bounded by O(.), where .is the number of all the non-tree edges. The query time of Core-I is bounded by O(log.). The Core-II labeling scheme has constant query time, but the labeling time is increased to O(.?+?.?+?.·.·.).作者: esthetician 時(shí)間: 2025-3-25 01:52
Continuous Consumer Equivalence Scalesplying Table Valued Functions (TVFs) to multiple data partitions. We further support the extensibility of this framework by allowing new FCFs to be defined from existing ones with SQL phrases. Based on this approach, we provided a SQL based high-level interface for “structured parallel computing” in作者: capillaries 時(shí)間: 2025-3-25 03:33
H. Wachtel,K.-J. Rettig,P.-A. L?schmannl method that transforms the tracking problem into a min-cost max-flow problem. We then utilize well-known graph algorithms that work in polynomial time with respect to the number of objects. The experimental results indicate that the proposed methods produce high quality results that are comparable作者: 聯(lián)想記憶 時(shí)間: 2025-3-25 08:56 作者: 灰姑娘 時(shí)間: 2025-3-25 13:32 作者: xanthelasma 時(shí)間: 2025-3-25 18:11
Update on Children Who Use CAPD/CCPDic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.作者: Morbid 時(shí)間: 2025-3-25 22:37 作者: 減弱不好 時(shí)間: 2025-3-26 00:48 作者: Musket 時(shí)間: 2025-3-26 07:39 作者: neolith 時(shí)間: 2025-3-26 10:13 作者: 禍害隱伏 時(shí)間: 2025-3-26 15:19
Update on Children Who Use CAPD/CCPDic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.作者: CHECK 時(shí)間: 2025-3-26 20:40 作者: separate 時(shí)間: 2025-3-26 23:16 作者: Cirrhosis 時(shí)間: 2025-3-27 01:29 作者: climax 時(shí)間: 2025-3-27 05:40 作者: 榨取 時(shí)間: 2025-3-27 12:01 作者: MUTE 時(shí)間: 2025-3-27 14:31
K. D. Dounavi,W. Steiner,W. D. Maurery because of the use of a specific domain terminology, but also because the retrieved information is meant to be part of the professional task (a diagnosis, writing a law text, etc.). In this paper we address the problem of solving domain-specific precise queries. We present an information retrieval作者: 外星人 時(shí)間: 2025-3-27 21:20 作者: 小畫像 時(shí)間: 2025-3-27 23:30 作者: tic-douloureux 時(shí)間: 2025-3-28 05:07
https://doi.org/10.1007/978-3-540-85654-2Web services; Web-based information systems; XML; data mining; database; database management; database que作者: cylinder 時(shí)間: 2025-3-28 10:06 作者: 莎草 時(shí)間: 2025-3-28 13:31 作者: homeostasis 時(shí)間: 2025-3-28 14:45
Conference proceedings 2008rin, Italy, in September 2008. The 74 revised full papers presented together with 1 invited paper were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on data privacy; temporal, spatial and high dimensional databases; semantic Web and ontologies; qu作者: Magnitude 時(shí)間: 2025-3-28 20:59 作者: 他日關(guān)稅重重 時(shí)間: 2025-3-29 02:56
A Decidable Fuzzy Description Logic ,-,(,) .-.(.), which can not only support the representation and reasoning of fuzzy concept knowledge, but also support fuzzy data information with customized fuzzy data types and customized fuzzy data type predicates.作者: cacophony 時(shí)間: 2025-3-29 04:29 作者: 精確 時(shí)間: 2025-3-29 10:21 作者: 公司 時(shí)間: 2025-3-29 14:23 作者: 挫敗 時(shí)間: 2025-3-29 18:19
0302-9743 held in Turin, Italy, in September 2008. The 74 revised full papers presented together with 1 invited paper were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on data privacy; temporal, spatial and high dimensional databases; semantic Web and onto作者: 表否定 時(shí)間: 2025-3-29 22:07 作者: 菊花 時(shí)間: 2025-3-30 00:53
https://doi.org/10.1007/978-94-015-9886-6 .-.(.), which can not only support the representation and reasoning of fuzzy concept knowledge, but also support fuzzy data information with customized fuzzy data types and customized fuzzy data type predicates.
