標題: Titlebook: Database and Expert Systems Applications; 25th International C Hendrik Decker,Lenka Lhotská,Roland R. Wagner Conference proceedings 2014 Sp [打印本頁] 作者: deduce 時間: 2025-3-21 18:05
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡公開度學科排名
書目名稱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讀者反饋學科排名
作者: obsession 時間: 2025-3-21 21:21
Das Einsatzspektrum des Controllers generalize the efficient techniques of the LCA-based approaches for searching over XML IDREF graph. The experimental results show that our approach outperforms the existing approaches in term of both effectiveness and efficiency.作者: 洞穴 時間: 2025-3-22 03:55 作者: 神圣將軍 時間: 2025-3-22 05:19
https://doi.org/10.1007/978-3-663-13666-8n propose effective approaches that allow the clients to execute the skyline query at any location. Last, the proposed broadcasting protocols are evaluated by performing the experiments in terms of the latency, tuning time, and memory usage.作者: 群居動物 時間: 2025-3-22 10:39 作者: 泥土謙卑 時間: 2025-3-22 14:07
A Study on External Memory Scan-Based Skyline Algorithmspecific design choices can have a significant impact on performance. We also demonstrate that, contrary to common belief, simpler skyline algorithm can be much faster than methods based on pre-processing.作者: 泥土謙卑 時間: 2025-3-22 19:35 作者: filial 時間: 2025-3-23 00:27
Discovering , Conditional Functional Dependencies with Built-in Predicatesed to impose constraints on data; they can also represent relationships among data, and therefore they can be mined from datasets. In the present work, after having introduced the distinction between . and . CFD.s, we describe an algorithm to discover . CFD.s from datasets.作者: 放逐 時間: 2025-3-23 01:30 作者: STENT 時間: 2025-3-23 09:37 作者: 悲痛 時間: 2025-3-23 10:59 作者: 邊緣 時間: 2025-3-23 16:59
Summary-Based Pattern Tableaux Generation for Conditional Functional Dependencies in Distributed Datlation, without merging all the distributed tuples in a centralized relation. We propose a distributed algorithm based on the concept of pattern summary that minimizes data shipping between the sites of distributed relation.作者: Servile 時間: 2025-3-23 19:54
Searching for Local Twitter Users by Extracting Regional Termsnal distribution of users whose tweets contain those terms, and the temporal distribution of tweets. Then, we construct a local area feature vector to represent the target area and compare it with a user vector to find local users. The experimental results validate our methods.作者: THROB 時間: 2025-3-24 01:43
Conference proceedings 2014ord search; skyline queries; graph algorithms; information retrieval; XML; security; semantic web; classification and clustering; queries; social computing; similarity search; ranking; data mining; big data; approximations; privacy; data exchange; data integration; web semantics; repositories; partitioning; and business applications.作者: 歌劇等 時間: 2025-3-24 02:42
0302-9743 Systems Applications, DEXA 2014, held in Munich, Germany, September 1-4, 2014. The 37 revised full papers presented together with 46 short papers, and 2 keynote talks, were carefully reviewed and selected from 159 submissions. The papers discuss a range of topics including: data quality; social web作者: BULLY 時間: 2025-3-24 09:46
The Political Economy of the USSRed to impose constraints on data; they can also represent relationships among data, and therefore they can be mined from datasets. In the present work, after having introduced the distinction between . and . CFD.s, we describe an algorithm to discover . CFD.s from datasets.作者: 無法破譯 時間: 2025-3-24 13:30 作者: 大吃大喝 時間: 2025-3-24 18:52
Conference proceedings 2014pplications, DEXA 2014, held in Munich, Germany, September 1-4, 2014. The 37 revised full papers presented together with 46 short papers, and 2 keynote talks, were carefully reviewed and selected from 159 submissions. The papers discuss a range of topics including: data quality; social web; XML keyw作者: 去掉 時間: 2025-3-24 22:34 作者: demote 時間: 2025-3-25 02:53 作者: engender 時間: 2025-3-25 07:10 作者: 寬大 時間: 2025-3-25 10:56
Entwicklungslinien der Controllingforschungs for tag recommendation of photos, the gain of using spatial and textual information in order to recommend more meaningful tags to users has not been studied yet. In this paper, we propose novel location-aware tag recommendation methods and demonstrate the effectiveness of our proposed methods.作者: jettison 時間: 2025-3-25 11:54 作者: 有機體 時間: 2025-3-25 16:13
https://doi.org/10.1007/978-3-322-81674-0rithm [14,15], can lead to search times that are on large documents more than twice as fast as the search times of the XML-based approach. Additionally, we utilize a smaller index, i.e., we consume less main memory to compute the results.作者: judicial 時間: 2025-3-25 22:40 作者: Mutter 時間: 2025-3-26 00:45 作者: Spinal-Fusion 時間: 2025-3-26 05:12 作者: plasma-cells 時間: 2025-3-26 11:50
Temporal Analysis of Sentiment in Tweets: A Case Study with FIFA Confederations Cup in Brazilayesian Classifiers. Although our technique could be applied to any language, the present study focused on tweets posted in Portuguese during the 2013 FIFA Confederations Cup. The achieved results represent one of the best applied to the Portuguese language.作者: 模仿 時間: 2025-3-26 15:07
Location-Aware Tag Recommendations for Flickrs for tag recommendation of photos, the gain of using spatial and textual information in order to recommend more meaningful tags to users has not been studied yet. In this paper, we propose novel location-aware tag recommendation methods and demonstrate the effectiveness of our proposed methods.作者: Protein 時間: 2025-3-26 20:28 作者: 擺動 時間: 2025-3-26 23:22 作者: OVERT 時間: 2025-3-27 03:23
Ontology Driven Indexing: Application to Personalized Information Retrievalw that system responses are entirely personalized and semantically enhanced by the ontological representation behind. These contributions are designed to allow the integration of external knowledge and their fundations enable an adaptation to various applications.作者: 推延 時間: 2025-3-27 08:34 作者: carotid-bruit 時間: 2025-3-27 09:34 作者: 諷刺滑稽戲劇 時間: 2025-3-27 13:50
On Continuous Spatial Skyline Queries over a Line Segmentconstraint of .. We propose two methods to solve the problem. In the first method, we find some special location points which partition . into sub-segments and also make the skylines in the adjacent sub-segments different. In the second method, we apply some properties to identify data points which 作者: 值得 時間: 2025-3-27 20:44
A Memory-Efficient Tree Edit Distance Algorithmin memory bottleneck. We show the correctness of our approach and prove an upper bound for the memory usage. Our empirical evaluation confirms the low memory requirements and shows that in practice our algorithm performs better than the analytic guarantees suggest.作者: 使隔離 時間: 2025-3-28 00:47 作者: Blemish 時間: 2025-3-28 04:09
https://doi.org/10.1007/978-981-13-0722-5 to the notion of sustainable constraint writing, we introduce a symbolic viewpoint on model manipulation that complements current mainstream viewpoints. The symbolic viewpoint is about denying a model/data level divide. We discuss sustainable constraint writing with respect to further issues in con作者: 聽寫 時間: 2025-3-28 08:15
The Political Economy of the USSRm random sampling of a rooted subtree with prescribed weight is unfortunately intractable. However, we are able to identify several practical cases that are tractable. The first case is uniform random sampling of a rooted subtree with prescribed size; the second case restricts to binary weights. For作者: indifferent 時間: 2025-3-28 12:59 作者: Ballad 時間: 2025-3-28 14:49
Alessandro Leonetti,Philipp Blumein memory bottleneck. We show the correctness of our approach and prove an upper bound for the memory usage. Our empirical evaluation confirms the low memory requirements and shows that in practice our algorithm performs better than the analytic guarantees suggest.作者: antiquated 時間: 2025-3-28 19:39
https://doi.org/10.1007/978-3-8349-7104-3ge graphs. Other algorithms based on CCRP like CCRP++ and Incremental Data Structure based CCRP have been proposed to scale them to larger graphs. In this paper, we analyze these algorithms from performance perspective and suggest a faster algorithm by extending the CCRP algorithm that avoids recomp作者: Interdict 時間: 2025-3-29 01:54
DB ? HCI: Towards Bridging the Chasm between Graph Data Management and HCIorts toward such interface design and devising efficient query processing techniques are independent to each other. This is primarily due to the chasm between . and data management fields as since their inception, rarely any systematic effort is made to leverage techniques and principles from each o作者: Interlocking 時間: 2025-3-29 06:18 作者: 使隔離 時間: 2025-3-29 08:54 作者: 享樂主義者 時間: 2025-3-29 13:09
Discovering , Conditional Functional Dependencies with Built-in Predicatesxtensions of Conditional Functional Dependencies with the addition, in the patterns of their data values, of the comparison operators. CFD.s can be used to impose constraints on data; they can also represent relationships among data, and therefore they can be mined from datasets. In the present work作者: 間接 時間: 2025-3-29 15:51 作者: 前奏曲 時間: 2025-3-29 23:08 作者: 慢慢流出 時間: 2025-3-30 03:26 作者: 完成 時間: 2025-3-30 04:15 作者: Arthritis 時間: 2025-3-30 08:51 作者: Fibroid 時間: 2025-3-30 15:42
Group-by and Aggregate Functions in XML Keyword Searcheral challenges including: (1) how to address the keyword ambiguity problem when interpreting a keyword query; (2) how to identify duplicated objects and relationships in order to guarantee the correctness of the results of aggregation functions; and (3) how to compute a keyword query with group-by 作者: Insensate 時間: 2025-3-30 20:15 作者: 言行自由 時間: 2025-3-30 23:39
Finding Missing Answers due to Object Duplication in XML Keyword Searchject as the child. However, this child object is not discovered by the typical LCA (Lowest Common Ancestor) based approaches in XML keyword search. This may lead to the problem of missing answers in those approaches. To solve this problem, we propose a new approach, in which we model an XML document作者: mechanism 時間: 2025-3-31 01:59
A Study on External Memory Scan-Based Skyline Algorithmse past few years the problem has been studied extensively, and a great number of external memory algorithms have been proposed. We thoroughly study the most important scan-based methods, which perform a number of passes over the database in order to extract the skyline. Although these algorithms are作者: escalate 時間: 2025-3-31 05:25
On Continuous Spatial Skyline Queries over a Line Segment for a skyline query can be dynamic, e.g., the distance to a beach of a moving vehicle. Consider a scenario as follows. A person in a moving vehicle issues a skyline query to find restaurants, taking into account the static attributes of the restaurants as well as the distance to them. This scenario作者: 變化 時間: 2025-3-31 09:12 作者: instructive 時間: 2025-3-31 14:38 作者: 泰然自若 時間: 2025-3-31 20:12
Efficient Evacuation Planning for Large Citiesubset of destination nodes where the people may be taken for safety, the evacuation route planner finds routes in this network to evacuate the people in minimum possible time. Evacuation route planning in pre-known disasters such as hurricanes is of utmost importance for civic authorities. Computing作者: 高腳酒杯 時間: 2025-4-1 01:29 作者: ANTE 時間: 2025-4-1 05:49 作者: 賄賂 時間: 2025-4-1 06:43
Database and Expert Systems Applications978-3-319-10073-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: bisphosphonate 時間: 2025-4-1 10:30
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263486.jpg
