標題: Titlebook: Database Systems for Advanced Applications; 18th International C Weiyi Meng,Ling Feng,Wei Song Conference proceedings 2013 Springer-Verlag [打印本頁] 作者: 出租 時間: 2025-3-21 16:29
書目名稱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é)科排名
作者: 吵鬧 時間: 2025-3-21 20:57
https://doi.org/10.1007/978-3-642-37450-0Web services; data semantics; geo-social networking; location based services; recommendation作者: FILTH 時間: 2025-3-22 01:18
978-3-642-37449-4Springer-Verlag Berlin Heidelberg 2013作者: Adenoma 時間: 2025-3-22 05:16
https://doi.org/10.1007/978-3-031-22539-0y. Utilizing disk-based parallel iterative computing is an economic solution. However, costs of disk I/O and communication affect the performance heavily. This paper proposes a state-transition model for SSSP and then designs two optimization strategies based on it. First, we introduce a tunable has作者: CRUC 時間: 2025-3-22 10:33 作者: 小臼 時間: 2025-3-22 14:49
Terminal Care Education for Doctorshe semantic web data on position-oriented query. In this paper, we introduce spatial SPARQL, a variant of SPARQL language, for querying spatial information integrated RDF data. Besides, we design a novel index SS-tree for evaluating the spatial queries. Based on the index, we propose a search algori作者: 小臼 時間: 2025-3-22 17:46
Stephen J. Ball,Sarah Bignold,Alan Cribb and sophisticated models exist to compare various data structures and to estimate query costs based on disk IO operations. Cost models for in-memory databases shift the focus from disk IOs to main memory accesses and CPU costs. However, modeling memory accesses is fundamentally different and common作者: 分發(fā) 時間: 2025-3-22 22:04
Terminal Care Education for DoctorsThis is mainly due to the spectacular development of ontologies in several domains like E-commerce, Engineering, Medicine, etc. Contrary to a traditional database, where its tuples are stored in a relational (table) layout, a . stores independently ontology and its instances in one of the three main作者: 呼吸 時間: 2025-3-23 03:44 作者: POINT 時間: 2025-3-23 05:38
Perceiving Distinct Particularsd) in a low-power mode, where a subset of nodes were powered off. Effectively reflecting the updated data is vital in making a distributed file system, such as the Hadoop Distributed File System (HDFS), power proportional. This paper presents a novel architecture, a NameNode and DataNode Coupling Ha作者: 綁架 時間: 2025-3-23 13:21
Contemporary Kantian Metaphysicsapping (matching) between the Web tables and the huge KBs. Existing solutions on schema mapping are inadequate for mapping a Web table and a KB, because of many reasons such as (1) there are many duplicates of entities and their types in a KB; (2) the schema of KB is often implicit, informal, and ev作者: 畸形 時間: 2025-3-23 17:19
Bird on Kant’s Mathematical Antinomies platform. Such advances include Web 2.0 for large-scale collaboration; Social-computing for increased awareness; as well as Cloud-computing, which have helped virtualized resources over the Internet. As a result, this new computing environment has thus presented developers with ubiquitous access to作者: 北極人 時間: 2025-3-23 20:37
https://doi.org/10.1057/9780230358911d higher. For creating such links we need to match their schemas. Moreover, for using these datasets in meaningful ways, one often needs to match not only two, but several schemas. This matching process establishes a (potentially large) set of attribute correspondences between multiple schemas that 作者: NEXUS 時間: 2025-3-24 00:49 作者: 有限 時間: 2025-3-24 02:59
Larraín’s ,: A Tale of Neoliberalism paper we take a different approach for maintaining stream program performance during crash failures. It is based on the concepts of automatic code generation. Albatross, the middleware we introduce for this task maintains the same performance level during crash failures based on predetermined prior作者: 護航艦 時間: 2025-3-24 08:36
Larraín’s ,: A Tale of Neoliberalism and understand what events happened. For an event, (which may consist of several component events, i.e., episodes), people are often interested in the whole picture of its evolution and development along a time line. This calls for modeling the dependent relationships between component events. Furt作者: 蒙太奇 時間: 2025-3-24 13:41 作者: 無節(jié)奏 時間: 2025-3-24 15:12
Dina L. Halegoua-De Marzio,David A. Sassmplicity and efficiency. However, k-means is instable and sensitive to the initial cluster centers, and it can be trapped in some local optimums. Moreover, its parameter of cluster number . is hard to be determined accurately. In this paper, we propose an improved k-means algorithm MAKM (MAFIA-based作者: 尊敬 時間: 2025-3-24 22:41
https://doi.org/10.1007/978-3-319-07209-8lation and processing by exploiting the latency offered by the . to filter irrelevant matches and prefetch partial query results. A key benefit of this paradigm is significant improvement of the . (.), which refers to the duration between the time a user presses the “Run” icon to the time when the u作者: amyloid 時間: 2025-3-24 23:40
Major Actors in Contemporary Marketsples. With its wonderful scalability, cloud computing platform like Hadoop is a good choice for processing queries over large data sets. Previous works on evaluating SPARQL queries with Hadoop mainly focus on reducing the number of joins through careful split of HDFS files and algorithms for generat作者: 蒙太奇 時間: 2025-3-25 06:12
Weiyi Meng,Ling Feng,Wei SongUp to date results.Fast track conference proceedings.State of the art research作者: Ancillary 時間: 2025-3-25 10:25 作者: LEERY 時間: 2025-3-25 12:39
Physical Column Organization in In-Memory Column Storesmeter evaluation, considering the number of distinct values, value skewness and value disorder. Finally, we present and evaluate a cost model based on cache misses for estimating the runtime of the discussed plan operations.作者: delusion 時間: 2025-3-25 18:42 作者: EXCEL 時間: 2025-3-25 20:02
ServiceBase: A Programming Knowledge-Base for Service Oriented Developmente-related low-level logic can be abstracted, organized, incrementally curated and thereby re-used by other application-developers. A framework is also proposed for decomposing and mapping raw service-messages into more common data-constructs, thus making interpreting, manipulating and chaining servi作者: Halfhearted 時間: 2025-3-26 03:18 作者: 胰島素 時間: 2025-3-26 06:57 作者: Immunotherapy 時間: 2025-3-26 11:17 作者: Fermentation 時間: 2025-3-26 13:08
Dynamic Label Propagation in Social Networksssible, and 2) finding a minimal set of nodes for labeling and then propagating the whole network with at least one label. Furthermore, we analyze the network structure that affects the selection and propagation results. Our algorithms are suitable for most propagation algorithms. In the experiment 作者: FIR 時間: 2025-3-26 18:02
: Blending Visual Multi-Source Twig Query Formulation and Query Processing in RDBMSource .wig .er), that addresses these limitations. A key practical feature of . is its portability as it . employ any special-purpose storage, indexing, and query cost estimation schemes. Experiments on real-world datasets demonstrate its effectiveness and superiority over existing methods based on 作者: BIAS 時間: 2025-3-26 22:43 作者: 不能平靜 時間: 2025-3-27 02:41
0302-9743 d in part 2: graph data management; physical design; knowledge management; temporal data management; social networks; query processing; data mining; applications; and database applications..978-3-642-37449-4978-3-642-37450-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 慷慨不好 時間: 2025-3-27 07:49
Stephen J. Ball,Sarah Bignold,Alan Cribbmeter evaluation, considering the number of distinct values, value skewness and value disorder. Finally, we present and evaluate a cost model based on cache misses for estimating the runtime of the discussed plan operations.作者: conscience 時間: 2025-3-27 13:27 作者: Dealing 時間: 2025-3-27 17:20 作者: Volatile-Oils 時間: 2025-3-27 18:54 作者: 不吉祥的女人 時間: 2025-3-28 01:19 作者: 痛苦一生 時間: 2025-3-28 02:19
Larraín’s ,: A Tale of Neoliberalismtemporal relationship, content dependence relationship, and event reference relationship for identifying to what an extent a component event is dependent on another component event in the evolution of a target event (i.e., query event). Experiments conducted on a real data set show that our method o作者: 方便 時間: 2025-3-28 08:39
Organ and Tissue Transplantationssible, and 2) finding a minimal set of nodes for labeling and then propagating the whole network with at least one label. Furthermore, we analyze the network structure that affects the selection and propagation results. Our algorithms are suitable for most propagation algorithms. In the experiment 作者: cruise 時間: 2025-3-28 13:52 作者: 冒煙 時間: 2025-3-28 16:22 作者: 細胞學(xué) 時間: 2025-3-28 20:22 作者: 言行自由 時間: 2025-3-29 00:36 作者: Gullible 時間: 2025-3-29 04:37
Larraín’s ,: A Tale of Neoliberalisme truthfulness determination is derived. Then we propose two methods to determine the truthfulness of the target fact statement. At last, we run comprehensive experiments to show .’s availability and high accuracy.作者: Keratin 時間: 2025-3-29 08:34 作者: indifferent 時間: 2025-3-29 14:43
https://doi.org/10.1007/978-3-031-22539-0policy to deal with the communication bottleneck. The experimental results illustrate that our SSSP computation is 2 times faster than a basic Giraph (a memory-resident parallel framework) implementation. Compared with Hadoop and Hama (disk-resident parallel frameworks), the speedup is 21 to 43.作者: 縫紉 時間: 2025-3-29 15:49 作者: 暫時中止 時間: 2025-3-29 20:18
Shortest Path Computation over Disk-Resident Large Graphs Based on Extended Bulk Synchronous Parallepolicy to deal with the communication bottleneck. The experimental results illustrate that our SSSP computation is 2 times faster than a basic Giraph (a memory-resident parallel framework) implementation. Compared with Hadoop and Hama (disk-resident parallel frameworks), the speedup is 21 to 43.作者: mosque 時間: 2025-3-30 02:47 作者: 急急忙忙 時間: 2025-3-30 05:08 作者: 箴言 時間: 2025-3-30 09:44 作者: CHAR 時間: 2025-3-30 12:34 作者: 單挑 時間: 2025-3-30 18:59 作者: Type-1-Diabetes 時間: 2025-3-30 21:17
Perceiving Distinct Particularsriments using actual machines show that NDCouplingHDFS is able to significantly reduce the execution time required to move updated blocks by 46% relative to the normal HDFS. Moreover, NDCouplingHDFS is capable of increasing the throughput of the system that is supporting MapReduce by applying an index in metadata management.作者: 表示問 時間: 2025-3-31 01:55
Contemporary Kantian Metaphysicsed data examples as well as the overall mapping of a table and a KB. Experiments over real data sets show that our solution is much more accurate than the two baselines of existing solutions. Results also show that our solution is feasible for the mapping of Web tables to large scale KBs.作者: 公豬 時間: 2025-3-31 08:50 作者: 開始從未 時間: 2025-3-31 11:27
A Specific Encryption Solution for Data Warehousesk and a real-world sales DW with Oracle 11g and Microsoft SQL Server 2008 shows that SES-DW achieves better response time in both inserting and querying, than standard and state-of-the-art encryption algorithms such as AES, 3DES, OPES and Salsa20, while providing considerable security strength.作者: CURL 時間: 2025-3-31 15:27
NameNode and DataNode Coupling for a Power-Proportional Hadoop Distributed File Systemriments using actual machines show that NDCouplingHDFS is able to significantly reduce the execution time required to move updated blocks by 46% relative to the normal HDFS. Moreover, NDCouplingHDFS is capable of increasing the throughput of the system that is supporting MapReduce by applying an index in metadata management.作者: 觀點 時間: 2025-3-31 17:53
Mapping Entity-Attribute Web Tables to Web-Scale Knowledge Basesed data examples as well as the overall mapping of a table and a KB. Experiments over real data sets show that our solution is much more accurate than the two baselines of existing solutions. Results also show that our solution is feasible for the mapping of Web tables to large scale KBs.作者: BURSA 時間: 2025-4-1 01:20
0302-9743 efereed proceedings of the 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013, held in Wuhan, China, in April 2013. The 51 revised full papers and 10 short papers presented together with 2 invited keynote talks, 1 invited paper, 3 industrial papers, 9 demo prese作者: infarct 時間: 2025-4-1 03:57 作者: 填料 時間: 2025-4-1 10:04 作者: 征兵 時間: 2025-4-1 10:11
Fast SimRank Computation over Disk-Resident Graphs recommendation systems. SimRank is a promising measure of similarity based on random surfers model. However, the computational complexity of SimRank is high and several optimization techniques have been proposed. In the paper optimization issue of SimRank computation in disk-resident graphs is our 作者: Electrolysis 時間: 2025-4-1 15:01 作者: Ancillary 時間: 2025-4-1 20:21 作者: dendrites 時間: 2025-4-2 01:17
