標(biāo)題: Titlebook: Database Systems for Advanced Applications; 15th International C Hiroyuki Kitagawa,Yoshiharu Ishikawa,Chiemi Watana Conference proceedings [打印本頁] 作者: 風(fēng)俗習(xí)慣 時(shí)間: 2025-3-21 19:48
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: 罐里有戒指 時(shí)間: 2025-3-21 21:10 作者: incisive 時(shí)間: 2025-3-22 00:53
Database Systems for Advanced Applications978-3-642-12026-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: FUME 時(shí)間: 2025-3-22 06:19
Brian Berkowitz,Ishai Dror,Bruno Yaron Web data have enabled the construction of very large knowledge bases. These knowledge collections contain facts about many millions of entities and relationships between them, and can be conveniently represented in the RDF data model. Prominent examples are DBpedia, YAGO, Freebase, Trueknowledge, a作者: 衰老 時(shí)間: 2025-3-22 10:40
Brian Berkowitz,Ishai Dror,Bruno Yaron use at Yahoo!–the Hadoop map-reduce system and the PNUTS/Sherpa storage system, in the broader context of offline and online data management in a cloud setting..Hadoop is a well known open source implementation of a distributed file system with a map-reduce interface. Yahoo! has been a major contri作者: 總 時(shí)間: 2025-3-22 13:41
Inorganic and Organometallic Compoundss been paid to the problem of efficient skyline computation in the P2P systems. Due to the high distribution of the P2P networks, the skyline computation incurs too many intermediate results transferred between peers, which consumes mass of the network bandwidth. Additionally, a large number of peer作者: 總 時(shí)間: 2025-3-22 17:16
Brian Berkowitz,Ishai Dror,Bruno YaronHT networks. The iDISQUE framework utilizes a distributed indexing scheme to organize data summary structures called iDisques, which describe the cluster information of the data on each peer. The publishing process of iDisques employs a locality-preserving mapping scheme. Approximate similarity quer作者: Endearing 時(shí)間: 2025-3-22 22:22 作者: TRAWL 時(shí)間: 2025-3-23 05:25 作者: PAC 時(shí)間: 2025-3-23 06:47
Inorganic and Organometallic Compoundsallenge is to identify patterns which appear frequently in different sequences. Well known algorithms have proved to be efficient, however these algorithms do not perform well when mining databases that have long frequent sequences. We present CAMLS, Constraint-based Apriori Mining of Long Sequences作者: 不整齊 時(shí)間: 2025-3-23 10:44 作者: 木訥 時(shí)間: 2025-3-23 16:13
Matthew M. Chumchal,Ray W. Drennered algorithms. Rules can be much more diverse, useful and interesting! This work introduces and solves the ... (GRM) problem, which abstracts rule mining, removes restrictions on the semantics of rules and redefines rule mining by functions on vectors. This also lends to an interesting geometric int作者: UNT 時(shí)間: 2025-3-23 20:19 作者: 磨碎 時(shí)間: 2025-3-24 00:18 作者: 現(xiàn)暈光 時(shí)間: 2025-3-24 03:54
Contaminants and Ecological Subsidieswig pattern against probabilistic XML data is essential. Some classical twig pattern algorithms can be adjusted to process the probabilistic XML. However, as far as finding answers of the top-. probabilities is concerned, the existing algorithms suffer in performance, because many unnecessary interm作者: perimenopause 時(shí)間: 2025-3-24 09:49
Hera Naheed Khan,Muhammad Faisaltain the query graph .. A variation to that is to find all occurrences of a particular pattern(the query) in a large database graph. We call it subgraph matching problem. The state of art solution to this problem is GADDI. In this paper, we will propose a more efficient index and algorithm to answer作者: notion 時(shí)間: 2025-3-24 11:44 作者: Deceit 時(shí)間: 2025-3-24 17:44
https://doi.org/10.1007/978-3-030-41552-5d telecommunication. In this paper, we study a new problem of discovering burst areas that exhibit dramatic changes during some periods in evolving graphs. We focus on finding the top-. results in a stream of fast graph evolutions. This problem is challenging because when the graph evolutions are co作者: lobster 時(shí)間: 2025-3-24 20:06 作者: 鋼盔 時(shí)間: 2025-3-25 01:14
Fantastic Floating Weeds and How to Use Themplexity escalates in large and dynamic environments, where the visibility set (i.e., the set of visible objects) of any viewpoint is probe to change at any time. However, exact visibility query is rarely necessary. Besides, it is inefficient, if not infeasible, to obtain the exact result in a dynami作者: 胖人手藝好 時(shí)間: 2025-3-25 05:52
Contaminants of the Great Lakesases and GIS they are frequently used as selection criteria in spatial queries. But the available models of cardinal relations suffer from a number of problems like the unequal treatment of the two spatial objects as arguments of a cardinal direction relation, the use of too coarse approximations of作者: Pelvic-Floor 時(shí)間: 2025-3-25 07:32
https://doi.org/10.1007/978-3-030-57874-9gorithms for the continuous monitoring of the constrained . nearest neighbor (.NN) queries. In contrast to the conventional . nearest neighbors (.NN) queries, a constrained .NN query considers only the objects that lie within a region specified by some user defined constraints (e.g., a polygon). Sim作者: 伙伴 時(shí)間: 2025-3-25 14:19
Hiroyuki Kitagawa,Yoshiharu Ishikawa,Chiemi WatanaFast track conference proceedings.State of the art research.Unique visibility作者: tattle 時(shí)間: 2025-3-25 18:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263418.jpg作者: 少量 時(shí)間: 2025-3-25 22:26
Conference proceedings 2010 management, as well as communities and Web graphs. The second volume contains contributions related to trajectories and moving objects, skyline queries, privacy and security, data streams, similarity search and event processing, storage and advanced topics, industrial, demo papers, and tutorials and panels.作者: pulmonary-edema 時(shí)間: 2025-3-26 02:55 作者: Cumulus 時(shí)間: 2025-3-26 08:05 作者: chisel 時(shí)間: 2025-3-26 11:30 作者: 火車車輪 時(shí)間: 2025-3-26 16:40
Biswojit Debnath,Golam Jalal Ahammedntics that has been widely adopted for probabilistic data management, and develop efficient methods to find threshold-based SP path queries over an uncertain graph. Extensive experiments based on real data sets verified the effectiveness of the proposed methods.作者: Palatial 時(shí)間: 2025-3-26 18:44
Contaminants of the Great LakesIn the first phase, a tiling strategy first determines the zones belonging to the nine cardinal directions of . spatial object and then intersects them. The result leads to a bounded grid called .. For each grid cell the information about the spatial objects that intersect it is stored in an .. In t作者: Ardent 時(shí)間: 2025-3-26 22:04
0302-9743 volume contains contributions related to trajectories and moving objects, skyline queries, privacy and security, data streams, similarity search and event processing, storage and advanced topics, industrial, demo papers, and tutorials and panels.978-3-642-12025-1978-3-642-12026-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: inconceivable 時(shí)間: 2025-3-27 04:14 作者: BOOR 時(shí)間: 2025-3-27 05:33 作者: Accessible 時(shí)間: 2025-3-27 11:10
Distributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networksperty of ., we can optimize the utilization of the cached results for answering future skyline queries. Extensive evaluations on both synthetic and real dataset show that our approach can significantly reduce both bandwidth consumption and communication cost, and greatly shorten the response time.作者: 老人病學(xué) 時(shí)間: 2025-3-27 16:34
Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphsntics that has been widely adopted for probabilistic data management, and develop efficient methods to find threshold-based SP path queries over an uncertain graph. Extensive experiments based on real data sets verified the effectiveness of the proposed methods.作者: 向外才掩飾 時(shí)間: 2025-3-27 18:08 作者: Apraxia 時(shí)間: 2025-3-28 01:23
PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patternsarallelism in order to enhance the performances of the fastest existing one (GRITE). Through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.作者: 富饒 時(shí)間: 2025-3-28 05:17
Effectively Inferring the Search-for Node Type in XML Keyword Searcha for inferring the search-for node type suffers from . and . problems..In this paper, we propose a . scheme as well as a novel algorithm . to resolve these two problems. Experimental results are provided to verify the effectiveness of our approach.作者: 閑聊 時(shí)間: 2025-3-28 08:08
Inorganic and Organometallic Compoundses in a dataset vary widely. In this paper, we exploit the notion of “item-to-pattern difference” and propose multiple . based FP-growth-like approach to efficiently discover rare association rules. Experimental results show that the proposed approach is efficient.作者: 剝削 時(shí)間: 2025-3-28 13:26
https://doi.org/10.1007/978-3-030-41552-5ming in a high speed, the solution should be capable of handling a large amount of evolutions in short time and returning the top-. results as soon as possible. The experimental results on real data sets show that our proposed solution is very efficient and effective.作者: obstruct 時(shí)間: 2025-3-28 17:33
Fantastic Floating Weeds and How to Use Themnique utilizes a filter-and-refine manner to prune regions that are not likely to be part of the top-. results, and refine the remaining regions. Experimental study based on a real world dataset verifies the effectiveness of the proposed region similarity measure and the efficiency of the algorithm.作者: 狂熱文化 時(shí)間: 2025-3-28 21:54 作者: 四目在模仿 時(shí)間: 2025-3-28 23:30
Contaminants and Ecological Subsidies is called ., to process probabilistic XML data based on element streams in document order, and the other is called ., based on the element streams ordered by the path probability values. Experiments have been conducted to study the performance of these algorithms.作者: 無禮回復(fù) 時(shí)間: 2025-3-29 05:03 作者: 翻動(dòng) 時(shí)間: 2025-3-29 08:25
CAMLS: A Constraint-Based Apriori Algorithm for Mining Long Sequenceses allows us to: (i) introduce a novel candidate pruning strategy that increases the efficiency of the mining process and (ii) easily incorporate considerations of intra-event and inter-event constraints. Experiments on both synthetic and real datasets show that CAMLS outperforms previous algorithms when mining long sequences.作者: 聽寫 時(shí)間: 2025-3-29 11:48 作者: 有毛就脫毛 時(shí)間: 2025-3-29 18:26 作者: insightful 時(shí)間: 2025-3-29 20:58
Mining Rare Association Rules in the Datasets with Widely Varying Items’ Frequencieses in a dataset vary widely. In this paper, we exploit the notion of “item-to-pattern difference” and propose multiple . based FP-growth-like approach to efficiently discover rare association rules. Experimental results show that the proposed approach is efficient.作者: Deduct 時(shí)間: 2025-3-30 03:10
Discovering Burst Areas in Fast Evolving Graphsming in a high speed, the solution should be capable of handling a large amount of evolutions in short time and returning the top-. results as soon as possible. The experimental results on real data sets show that our proposed solution is very efficient and effective.作者: CODA 時(shí)間: 2025-3-30 07:17 作者: 匯總 時(shí)間: 2025-3-30 11:52
Conference proceedings 2010 Applications, DASFAA 2010, held in Tsukuba, Japan, in April 2010. The 39 revised full papers and 16 revised short papers presented together with 3 invited keynote papers, 22 demonstration papers, 6 industrial papers, and 2 keynote talks were carefully reviewed and selected from 285 submissions. The作者: indigenous 時(shí)間: 2025-3-30 13:13 作者: 表狀態(tài) 時(shí)間: 2025-3-30 19:18 作者: Tremor 時(shí)間: 2025-3-30 22:49 作者: Emg827 時(shí)間: 2025-3-31 02:59 作者: 侵害 時(shí)間: 2025-3-31 05:25 作者: 我沒有命令 時(shí)間: 2025-3-31 11:39 作者: brassy 時(shí)間: 2025-3-31 16:51 作者: Virtues 時(shí)間: 2025-3-31 19:39 作者: padding 時(shí)間: 2025-3-31 23:36 作者: Palpitation 時(shí)間: 2025-4-1 02:11 作者: 流利圓滑 時(shí)間: 2025-4-1 09:35 作者: Pepsin 時(shí)間: 2025-4-1 13:42
Generalised Rule Miningethods and separate rule semantics from algorithmic considerations. The GRM algorithm scales linearly in the number of rules found and provides orders of magnitude speed up over fast candidate generation type approaches (in cases where these can be applied).作者: cavity 時(shí)間: 2025-4-1 14:59
An Effective Object-Level XML Keyword Searchfor the matching results. We propose efficient algorithms to compute and rank the query results in one phase. Finally, comprehensive experiments show the efficiency and effectiveness of our approach, and an online demo of our system on DBLP data is available at ..作者: APNEA 時(shí)間: 2025-4-1 22:20
Efficient Approximate Visibility Query in Large Dynamic Environmentsviewpoint . is an approximate visibility set such that its difference with the exact visibility set is guaranteed to be less than . with confidence .. We propose an approach to correctly and efficiently answer AVQ in large and dynamic environments. Our extensive experiments verified the efficiency of our approach.作者: Obsessed 時(shí)間: 2025-4-2 01:55 作者: 茁壯成長(zhǎng) 時(shí)間: 2025-4-2 03:36
Knowledge on the Web: Robust and Scalable Harvesting of Entity-Relationship Facts Web data have enabled the construction of very large knowledge bases. These knowledge collections contain facts about many millions of entities and relationships between them, and can be conveniently represented in the RDF data model. Prominent examples are DBpedia, YAGO, Freebase, Trueknowledge, a作者: BOOST 時(shí)間: 2025-4-2 10:54
Cloud Data Management @ Yahoo! use at Yahoo!–the Hadoop map-reduce system and the PNUTS/Sherpa storage system, in the broader context of offline and online data management in a cloud setting..Hadoop is a well known open source implementation of a distributed file system with a map-reduce interface. Yahoo! has been a major contri作者: 領(lǐng)巾 時(shí)間: 2025-4-2 11:54
