標(biāo)題: Titlebook: Database Systems for Advanced Applications; 20th International C Matthias Renz,Cyrus Shahabi,Muhammad Aamir Cheema Conference proceedings 2 [打印本頁] 作者: obesity 時(shí)間: 2025-3-21 17:21
書目名稱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é)科排名
作者: NAVEN 時(shí)間: 2025-3-21 22:20
978-3-319-18119-6Springer International Publishing Switzerland 2015作者: 的是兄弟 時(shí)間: 2025-3-22 01:57 作者: exquisite 時(shí)間: 2025-3-22 08:03
Quality Control Inspection Teamt finding is important to many real applications such as question routing and identification of best answers. Currently, many approaches of expert findings rely heavily on the past question-answering activities of the users in order to build user models. However, the past question-answering activiti作者: 出價(jià) 時(shí)間: 2025-3-22 09:54 作者: Canopy 時(shí)間: 2025-3-22 13:56
Construction Inspection Handbookaper, we present a novel approach for mining correlation in collections consisting of a large number of time series. In our approach, we use bursts co-occurring in different streams as the measure of their relatedness. By exploiting the pruning properties of our measure we develop new indexing struc作者: Canopy 時(shí)間: 2025-3-22 17:45 作者: 陰險(xiǎn) 時(shí)間: 2025-3-22 22:33 作者: 設(shè)想 時(shí)間: 2025-3-23 05:15
https://doi.org/10.1007/978-3-031-44021-2rmance characteristics of SSD make it well-suited for use as a second-level buffer cache. In this paper, we propose a SSD-based multilevel buffer scheme, called flash-aware second-level cache(FASC), where SSD serves as an extension of the DRAM buffer. Our goal is to reduce the number of disk accesse作者: 隨意 時(shí)間: 2025-3-23 06:29
https://doi.org/10.1007/978-1-349-14458-7 for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In order to reduce memory consumption, this data structure作者: 確定的事 時(shí)間: 2025-3-23 10:54 作者: TIGER 時(shí)間: 2025-3-23 17:24
Construction and Demolition Waste,idean distance as the measurement of spatial proximity. In this paper, we investigate a variant of spatial assignment problem with road networks as the underlying space. Given a set of passengers and a set of vehicles, where each vehicle waits for the arrival of all passengers assigned to it, and th作者: 燦爛 時(shí)間: 2025-3-23 18:20 作者: Pelago 時(shí)間: 2025-3-24 00:37
Database Systems for Advanced Applications978-3-319-18120-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Asparagus 時(shí)間: 2025-3-24 05:59 作者: EPT 時(shí)間: 2025-3-24 07:05
Leveraging Homomorphisms and Bitmaps to Enable the Mining of Embedded Patterns from Large Data Treestterns from large trees. We propose a novel approach that exploits efficient homomorphic pattern matching algorithms to compute pattern support incrementally and avoids the costly enumeration of all pattern matchings required by previous approaches. A further originality of our approach is that matc作者: habile 時(shí)間: 2025-3-24 10:42 作者: Alienated 時(shí)間: 2025-3-24 17:08 作者: GORGE 時(shí)間: 2025-3-24 21:01
Adaptive Grid-Based k-median Clustering of Streaming Data with Accuracy Guaranteepose a general and adaptive solution, which partitions stream data into cells of dynamically determined granularity and runs k-median clustering on the statistical information of cells with an accuracy guarantee. An extensive experiment over three real datasets clearly shows that our solution provid作者: 敘述 時(shí)間: 2025-3-25 00:35 作者: 掃興 時(shí)間: 2025-3-25 06:10 作者: drusen 時(shí)間: 2025-3-25 08:24
The Gaussian Bloom Filteroom filter can be extracted in time linear to the size of the data structure and that the Bloom filter is a special case of our construction. We show that the approach provides a relevant gain with respect to the false positive rate. Implementations for Apache Cassandra, C++, and NVIDIA CUDA are giv作者: 共和國(guó) 時(shí)間: 2025-3-25 15:43 作者: 無法治愈 時(shí)間: 2025-3-25 17:48
On Efficient Passenger Assignment for Group Transportationose two exact solutions to find the optimal results, and then an approximate solution to achieve higher efficiency by trading off a little accuracy. Finally, performances of all proposed algorithms are evaluated on a real dataset.作者: 褪色 時(shí)間: 2025-3-25 20:51
Effective and Efficient Predictive Density Queries for Indoor Moving Objectse query efficiency significantly. Finally, we apply an accurate method and an approximate sampling method to verify whether each unpruned region is a dense region. Extensive experiments on real datasets demonstrate that the proposed solutions can outperform the baseline algorithm by up to . orders o作者: Lacerate 時(shí)間: 2025-3-26 02:27
Grouping Methods for Pattern Matching in Probabilistic Data Streams作者: 匍匐 時(shí)間: 2025-3-26 05:46
Fast Similarity Search of Multi-Dimensional Time Series via Segment Rotation作者: 高爾夫 時(shí)間: 2025-3-26 11:33
Measuring the Influence from User-Generated Content to News via Cross-dependence Topic Modeling作者: farewell 時(shí)間: 2025-3-26 14:12 作者: 根除 時(shí)間: 2025-3-26 17:07 作者: 不公開 時(shí)間: 2025-3-26 23:05
Quality Control Inspection Teamr-to-user graph in CQA systems. Next, we propose the . (GRLM) to infer the expertise of users based on both past question-answering activities and an inferred user-to-user graph. We then devise an iterative variational method for inferring the GRLM model. We evaluate our method on a well-known quest作者: overshadow 時(shí)間: 2025-3-27 01:06
https://doi.org/10.1007/978-1-4757-1191-2bounds) for sets of similar itemset-DSPs and use that representation to improve efficiency of our proposed algorithm. Our empirical study using both real data and synthetic data demonstrates that iDSP-Miner is effective and efficient.作者: ANT 時(shí)間: 2025-3-27 08:51
Construction Products Liabilitypose a general and adaptive solution, which partitions stream data into cells of dynamically determined granularity and runs k-median clustering on the statistical information of cells with an accuracy guarantee. An extensive experiment over three real datasets clearly shows that our solution provid作者: 口味 時(shí)間: 2025-3-27 10:56
Rehan Khan,Rahul Tomar,Ahmed Ibrahimemory dense index for the operation logs on SSD. Our evaluation mainly characterizes the throughput of read and write, namely the ops/sec(. operations per second). Experiments show that our SASS design enjoys up to 96806 write ops/sec and 3072 read ops/sec over 2 billion key-value pairs.作者: 整潔漂亮 時(shí)間: 2025-3-27 13:57 作者: Resign 時(shí)間: 2025-3-27 20:02 作者: DAFT 時(shí)間: 2025-3-28 00:07 作者: defibrillator 時(shí)間: 2025-3-28 04:38 作者: 狗舍 時(shí)間: 2025-3-28 08:15 作者: MIRTH 時(shí)間: 2025-3-28 11:25 作者: 集合 時(shí)間: 2025-3-28 16:14 作者: Eructation 時(shí)間: 2025-3-28 21:23 作者: 上釉彩 時(shí)間: 2025-3-28 23:31 作者: 懦夫 時(shí)間: 2025-3-29 06:36 作者: Perceive 時(shí)間: 2025-3-29 07:15 作者: slow-wave-sleep 時(shí)間: 2025-3-29 13:26 作者: Optimum 時(shí)間: 2025-3-29 19:03
Cold-Start Expert Finding in Community Question Answering via Graph Regularizationt finding is important to many real applications such as question routing and identification of best answers. Currently, many approaches of expert findings rely heavily on the past question-answering activities of the users in order to build user models. However, the past question-answering activiti作者: 取之不竭 時(shí)間: 2025-3-29 23:07 作者: 伙伴 時(shí)間: 2025-3-30 02:33
Mining Correlations on Massive Bursty Time Series Collectionsaper, we present a novel approach for mining correlation in collections consisting of a large number of time series. In our approach, we use bursts co-occurring in different streams as the measure of their relatedness. By exploiting the pruning properties of our measure we develop new indexing struc作者: 蝕刻 時(shí)間: 2025-3-30 05:17
Adaptive Grid-Based k-median Clustering of Streaming Data with Accuracy Guaranteepartitions stream data into cells, derives statistical information of the cells, and then applies clustering on these much smaller statistical information without referring to the input data. Therefore, grid-based clustering is efficient and very suitable for high-throughput data streams, which are 作者: 放縱 時(shí)間: 2025-3-30 09:55
SASS: A High-Performance Key-Value Store Design for Massive Hybrid Storagent data modifications. In this paper, we present SSD-assisted storage system (SASS), a novel high-throughput KV store design using massive hybrid storage. SASS meets three exclusive requirements of enterprise-class data management: supporting billions of key-value pairs, processing thousands of key-作者: GLOSS 時(shí)間: 2025-3-30 16:05 作者: 在前面 時(shí)間: 2025-3-30 18:02 作者: 蔑視 時(shí)間: 2025-3-30 22:53 作者: lipids 時(shí)間: 2025-3-31 04:04 作者: 宇宙你 時(shí)間: 2025-3-31 06:56 作者: 施舍 時(shí)間: 2025-3-31 09:55
https://doi.org/10.1007/978-3-322-85327-1Arbeit; Arbeitswissenschaft; Arbeitszeit; Arbeitszufriedenheit; Bilanz; Führungsstil; Gesundheitsschutz; In
