標(biāo)題: Titlebook: Big Data; 29th British Nationa Georg Gottlob,Giovanni Grasso,Christian Schallhart Conference proceedings 2013 Springer-Verlag Berlin Heidel [打印本頁] 作者: DUBIT 時間: 2025-3-21 20:04
書目名稱Big Data影響因子(影響力)
書目名稱Big Data影響因子(影響力)學(xué)科排名
書目名稱Big Data網(wǎng)絡(luò)公開度
書目名稱Big Data網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Big Data被引頻次
書目名稱Big Data被引頻次學(xué)科排名
書目名稱Big Data年度引用
書目名稱Big Data年度引用學(xué)科排名
書目名稱Big Data讀者反饋
書目名稱Big Data讀者反饋學(xué)科排名
作者: FADE 時間: 2025-3-21 20:16 作者: 金絲雀 時間: 2025-3-22 01:00
https://doi.org/10.1007/978-3-662-07992-8Large volumes of graph-structured data are becoming increasingly prevalent in areas such as作者: 巧思 時間: 2025-3-22 08:35
Database Research Challenges and Opportunities of Big Graph DataLarge volumes of graph-structured data are becoming increasingly prevalent in areas such as作者: 護(hù)航艦 時間: 2025-3-22 12:39
Ali Cavit,Haluk Ozcanli,A. Merter Ozencio fast for optimal storage and indexing; and it is too heterogeneous to fit into a rigid schema. There is a huge pressure on database researchers to study, explain, and solve the technical challenges in big data, but we find no inspiration in the three Vs. Volume is surely nothing new for us, stream作者: MODE 時間: 2025-3-22 16:14
Ali Cavit,Haluk Ozcanli,A. Merter Ozencireas move closer, to the point that they overlap and merge. Researchers in programming languages and compiler construction want to take part in this revolution, and also have to respond to the need of programmers for suitable tools to develop data-driven software for data-intensive tasks and analyti作者: Asparagus 時間: 2025-3-22 17:21
Ali Cavit,Haluk Ozcanli,A. Merter Ozencit of mainstream database research. Moreover, the topic has now infected nearly every branch of computer science: provenance is a problem for everyone. But what exactly is the problem? And has the copious research had any real effect on how we use databases or, more generally, how we use computers..T作者: 動脈 時間: 2025-3-22 22:02
Isaac J. Rondon,Wayne A. Marascos, combine rich databases with software driven by machine learning. The spectacular successes of these trained systems have been among the most notable in all of computing and have generated excitement in health care, finance, energy, and general business. But building them can be challenging even f作者: parallelism 時間: 2025-3-23 02:39
Jennifer H. Richardson,Wayne A. Marascouery classes can be considered tractable in the context of big data? How can we make query answering feasible on big data? What should we do about the quality of the data, the other side of big data? This paper aims to provide an overview of recent advances in tackling these questions, using social 作者: 小木槌 時間: 2025-3-23 06:41 作者: CANE 時間: 2025-3-23 12:04
https://doi.org/10.1007/978-1-4615-5113-3essing of database engines for the much less efficient tuple-at-a-time processing of a procedural language. In this work, we consider the problem of rewriting for-loops with update statements into sequences of updates which do not use loops or cursors and which simultaneously carry out the action of作者: 險代理人 時間: 2025-3-23 17:51
Cholesterol Trafficking in CaCo-2 Cellses such as Flash and Non-Volatile Memories. Any modification of a data item in a MV-DBMS results in the creation of a new version. Traditional implementations, physically stamp old versions as invalidated, causing in-place updates resulting in random writes and ultimately in mixed loads, all of whic作者: 愉快么 時間: 2025-3-23 18:02 作者: 合同 時間: 2025-3-24 02:09
Rupa R. Sawant,Vladimir P. Torchilints of most matching algorithms are expressed as semantically inexpressive, 1-to-1 associations between pairs of attributes or entities, rather than semantically-rich characterisations of relationships. This paper presents a benchmark for evaluating schema matching algorithms in terms of their semant作者: glisten 時間: 2025-3-24 02:54
Stimuli-Responsive Polymersomesic databases (.) is launched. Large panoply of these . exists. Three main characteristics may be used to differentiate them: (i) the storage layouts for storing instances and the ontology, (ii) ontology modeling languages, and (iii) the architecture of the target database management system (DBMS) su作者: Banister 時間: 2025-3-24 08:17
Rupa R. Sawant,Vladimir P. Torchilin. In probabilistic relational models, tuples are annotated with probabilities or formulae over Boolean random variables. In probabilistic XML models, XML trees are augmented with nodes that specify probability distributions over their children. Both kinds of models have been extensively studied, wit作者: FRONT 時間: 2025-3-24 14:31
Christine Vauthier,Kawthar Bouchemalnt at web scale have stimulated a recent trend towards the development of document-centric “NoSQL” data stores. Many query tasks naturally involve reasoning over data residing across NoSQL and relational “SQL” databases. Having data divided over separate stores currently implies labor-intensive manu作者: misshapen 時間: 2025-3-24 18:07
https://doi.org/10.1007/978-94-017-8896-0stion still was, given an XPath Query and an update operation, how to efficiently compute the update positions within a grammar representing a compressed XML file. In this paper, we propose an automaton-based solution, which computes these positions, combines them in a so-called Update DAG, supports作者: Ccu106 時間: 2025-3-24 20:11
Hiroyasu Takemoto,Nobuhiro Nishiyama process the twig patterns in XML queries. However, a more general form of twig patterns, called B-twig (or Boolean-twig), which allow arbitrary combination of all the three logical connectives, AND, OR, and NOT in the twig patterns, has not yet been adequately addressed. In this paper, a new approa作者: TRAWL 時間: 2025-3-25 00:23
Gurusamy Saravanakumar,Won Jong Kimommunication and synchronization issues from the user and allow processing of high volumes of data on thousands of commodity computers. In this paper we are interested in applying MR to processing hierarchical data with nested collections such as stored in JSON or XML formats but with restricted nes作者: 傀儡 時間: 2025-3-25 05:20 作者: coddle 時間: 2025-3-25 11:26 作者: 蛤肉 時間: 2025-3-25 13:06 作者: amplitude 時間: 2025-3-25 16:04 作者: 鬧劇 時間: 2025-3-25 21:01
https://doi.org/10.1007/978-3-642-39467-6Web information extraction; data management; network mining; parallel databases; semantic databases; data作者: oxidize 時間: 2025-3-26 02:04
978-3-642-39466-9Springer-Verlag Berlin Heidelberg 2013作者: Charitable 時間: 2025-3-26 06:55
Querying Big Social Datauery classes can be considered tractable in the context of big data? How can we make query answering feasible on big data? What should we do about the quality of the data, the other side of big data? This paper aims to provide an overview of recent advances in tackling these questions, using social network analysis as an example.作者: 殺死 時間: 2025-3-26 11:14 作者: Endometrium 時間: 2025-3-26 16:10
Ali Cavit,Haluk Ozcanli,A. Merter Ozencitudy, explain, and solve the technical challenges in big data, but we find no inspiration in the three Vs. Volume is surely nothing new for us, streaming databases have been extensively studied over a decade, while data integration and semistructured has studied heterogeneity from all possible angles.作者: SPURN 時間: 2025-3-26 20:09
Big Data Begets Big Database Theorytudy, explain, and solve the technical challenges in big data, but we find no inspiration in the three Vs. Volume is surely nothing new for us, streaming databases have been extensively studied over a decade, while data integration and semistructured has studied heterogeneity from all possible angles.作者: 爭吵加 時間: 2025-3-26 21:11 作者: 裂隙 時間: 2025-3-27 01:25 作者: chassis 時間: 2025-3-27 05:20
Stimuli-Responsive Polymersomesf the DBA, mathematical cost models are presented to evaluate the performance of each type of .. Finally, two types of intensive experiments are conducted by considering six ., both issued from industry and academic communities; one based on our mathematical cost models and another based on the studied semantic DBMS cost models.作者: 拖債 時間: 2025-3-27 11:29
Fundamental Biomedical Technologiescuted over a massive 8TB TPC-H instance, the proposed estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and achieves linear scalability.作者: 偽善 時間: 2025-3-27 15:23
A Tutorial on Trained Systems: A New Generation of Data Management Systems? English Literature..Papers, software, virtual machines that contain installations of our software, links to applications that are discussed in this talk, and our list of collaborators are available from our project page. We also have a YouTube channel.作者: 擴(kuò)張 時間: 2025-3-27 19:46
Towards Performance Evaluation of Semantic Databases Management Systemsf the DBA, mathematical cost models are presented to evaluate the performance of each type of .. Finally, two types of intensive experiments are conducted by considering six ., both issued from industry and academic communities; one based on our mathematical cost models and another based on the studied semantic DBMS cost models.作者: Endearing 時間: 2025-3-28 01:40
Sampling Estimators for Parallel Online Aggregationcuted over a massive 8TB TPC-H instance, the proposed estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and achieves linear scalability.作者: 淡紫色花 時間: 2025-3-28 05:40 作者: LAST 時間: 2025-3-28 08:37
Eric J. Smart,Deneys R. van der Westhuyzenlues the interpreted attributes may take whenever a certain condition holds on the non-interpreted ones, and investigate lossless horizontal decomposition under CDCs in isolation, as well as in combination with functional and unary inclusion dependencies.作者: 規(guī)范要多 時間: 2025-3-28 14:05 作者: Vulnerary 時間: 2025-3-28 15:08 作者: GROUP 時間: 2025-3-28 20:56 作者: 建筑師 時間: 2025-3-29 00:04
https://doi.org/10.1007/978-1-4615-5113-3 several loop iterations in a set-at-a-time manner. We identify idempotence as the crucial condition for allowing such a rewriting. We formulate concrete rewrite rules for single updates in a loop and extend them to sequences of updates in a loop.作者: apropos 時間: 2025-3-29 03:06
https://doi.org/10.1007/978-94-017-8896-0 parallel updates, and uses dynamic programming to avoid an implicit decompression of the grammar. As a result, our solution updates compressed XML even faster than MXQuery and Qizx update uncompressed XML.作者: IRS 時間: 2025-3-29 08:26
Hiroyasu Takemoto,Nobuhiro Nishiyamach accompanied with an optimal implementation algorithm is presented for efficiently processing B-twig XML queries. Experimental study confirms the viability and performance superiority of our new approach.作者: Ballerina 時間: 2025-3-29 15:16 作者: dendrites 時間: 2025-3-29 16:29 作者: BROTH 時間: 2025-3-29 20:17
A Practical Approach to Holistic B-Twig Pattern Matching for Efficient XML Query Processingch accompanied with an optimal implementation algorithm is presented for efficiently processing B-twig XML queries. Experimental study confirms the viability and performance superiority of our new approach.作者: 富饒 時間: 2025-3-30 03:40 作者: 過時 時間: 2025-3-30 04:58 作者: 熱情贊揚 時間: 2025-3-30 11:24
Silvia Biocca,Antonino Cattaneo The goal is to extend the lifetime of the QEP, i.e., the period during which it produces results, beyond the point where node failures start to occur. We contribute descriptions of two different approaches that have been implemented in an existing SNQP and present experimental results indicating th作者: Amylase 時間: 2025-3-30 15:33 作者: overwrought 時間: 2025-3-30 20:04 作者: RAGE 時間: 2025-3-30 22:43 作者: 減弱不好 時間: 2025-3-31 02:38 作者: STING 時間: 2025-3-31 08:37
Gurusamy Saravanakumar,Won Jong Kims. We demonstrate this by showing that MapReduce programs can be expressed and represented straightforwardly in NRC by adding syntactic short-hands. In addition we show that optimizations in existing systems can be readily represented in this extended formalism.作者: MANIA 時間: 2025-3-31 10:02
Zwitterionic Nanocarriers for Gene Deliveryeduce-based solution for bisimulation. Motivated by these observations we propose in this paper the first efficient MapReduce-based algorithm for computing the bisimulation partition of massive graphs. We also detail several optimizations for handling the data skew which often arises in real-world g作者: Asparagus 時間: 2025-3-31 15:26 作者: 色情 時間: 2025-3-31 20:01 作者: Blasphemy 時間: 2025-3-31 23:06
Append Storage in Multi-Version Databases on Flashcan benefit from Append-Based storage, and how a Flash-optimised approach called SIAS (Snapshot Isolation Append Storage) can improve performance. While traditional LbSM use coarse-grain page append granularity, SIAS performs appends in tuple-version granularity and manages versions as simply linked作者: Resection 時間: 2025-4-1 02:48
MatchBench: Benchmarking Schema Matching Algorithms for Schematic Correspondencesan be used to investigate the effectiveness of different matching algorithms; and (iii) an application of the experiments for the evaluation of matchers from three well-known and publicly available schema matching systems, namely COMA++, Similarity Flooding and Harmony.作者: 瑪瑙 時間: 2025-4-1 07:40
On the Connections between Relational?and?XML Probabilistic Data Models been made explicit: we detail such translations in this article, in both directions, study their impact in terms of complexity results, and present interesting open issues about the connections between relational and XML probabilistic data models.作者: 去世 時間: 2025-4-1 12:04
On Bridging Relational and Document-Centric Data Storesia variable bindings. We give an effective solution for translating the user query to an equivalent pure SQL query, and present optimization strategies for query processing. We have implemented a prototype of our framework using .SQL and .DB and have performed an extensive empirical analysis. Our st作者: 通便 時間: 2025-4-1 18:21 作者: archaeology 時間: 2025-4-1 19:02
Bisimulation Reduction of Big Graphs on MapReduceeduce-based solution for bisimulation. Motivated by these observations we propose in this paper the first efficient MapReduce-based algorithm for computing the bisimulation partition of massive graphs. We also detail several optimizations for handling the data skew which often arises in real-world g
