標(biāo)題: Titlebook: Database Systems for Advanced Applications; 19th International C Sourav S. Bhowmick,Curtis E. Dyreson,Bernhard Thal Conference proceedings [打印本頁] 作者: Spouse 時間: 2025-3-21 18:47
書目名稱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 22:20
Online Indexing and Distributed Querying Model-View Sensor Data in the Cloudof sensor data becomes increasingly important at present. Traditional sensor data management systems based on relational database lack scalability to accommodate large-scale sensor data efficiently. Consequently, distributed key-value stores in the cloud is becoming the prime tool to manage sensor d作者: 詞匯表 時間: 2025-3-22 03:46
Discovery of Areas with Locally Maximal Confidence from Location Dataough location data obtained from GPS-equipped devices have promising applications, those GPS points are usually not uniformly distributed in two-dimensional space. As a result, substantial insights might be missed by using data mining algorithms that discover admissible or rectangular areas under th作者: BUDGE 時間: 2025-3-22 07:43 作者: 樹膠 時間: 2025-3-22 10:51 作者: 竊喜 時間: 2025-3-22 13:13
Scalable Numerical Queries by Algebraic Inequality Transformations readings into a relational database system. SQL queries over such log data often involve numerical conditions containing inequalities, e.g. to find suspected deviations from normal behavior based on some function over measured sensor values. However, such queries are often slow to execute, because 作者: 竊喜 時間: 2025-3-22 18:25 作者: 一起 時間: 2025-3-22 21:41
Concurrent Execution of Mixed Enterprise Workloads on In-Memory Databasesve, both application classes issue a database workload with commonly agreed characteristics. However, traditional database management systems (DBMS) are typically optimized for one or the other. Today, we see two trends in enterprise applications that require bridging these two workload categories: 作者: Cardioplegia 時間: 2025-3-23 04:19
On Data Partitioning in Tree Structure Metric-Space Indexesd pivots). There are two basic forms of data partitioning: ball partition and General Hyper-plane (GH) partition. Most existing work only shows their superiority experimentally, and little theoretical proof is found. We propose an approach to unify existing data partitioning methods and analyze thei作者: SPASM 時間: 2025-3-23 06:26 作者: indices 時間: 2025-3-23 13:00 作者: 斜谷 時間: 2025-3-23 17:54 作者: 出價 時間: 2025-3-23 20:05
Privacy-Preserving Reachability Query Services is becoming economically appealing to outsource graph data to a third-party service provider (.), to provide query services. However, . cannot always be trusted. Hence, data owners and query clients may prefer not to expose their data graphs and queries. This paper studies privacy-preserving query 作者: microscopic 時間: 2025-3-24 00:06
SKY R-tree: An Index Structure for Distance-Based Top-k Query, a top-k query may be issued by taking into account both the location information and non-spatial attributes. This paper focuses on a distance-based top-k query which retrieves the best objects based on distance from candidate objects to a query point as well as other non-spatial attributes. In thi作者: 過多 時間: 2025-3-24 03:27 作者: 協(xié)迫 時間: 2025-3-24 09:43
Efficient Processing of Which-Edge Questions on Shortest Path Queriesthe total distance for a given set of shortest path queries on a graph. This problem has important applications in logistics, urban planning, and network planning. We show the NP-hardness of the problem, as well as present efficient algorithms that compute highly accurate results in practice. Experi作者: 粗魯性質(zhì) 時間: 2025-3-24 11:15 作者: 無關(guān)緊要 時間: 2025-3-24 18:27 作者: 可能性 時間: 2025-3-24 22:23 作者: kidney 時間: 2025-3-25 02:00
Qualit?tsmanagement in Beratungsunternehmenlable search space. In particular, SAQR utilizes both similarity-based and cardinality-based pruning techniques to bound the search space and quickly find a refined query that meets the user expectations. Our experimental evaluation shows the scalability exhibited by SAQR under various workload sett作者: Analogy 時間: 2025-3-25 03:18 作者: Ostrich 時間: 2025-3-25 08:18 作者: Osteoarthritis 時間: 2025-3-25 15:04
Consumer Behavior During a Brand Crisishe moving objects’ view of space by using density-based clustering to overcome the problems. In our experiments, CTV-DBN is used to reveal the evolution of time-varying region macro structure in a ring road system based on trajectories, and to obtain a local time-varying road junction dependency str作者: Musculoskeletal 時間: 2025-3-25 16:32
https://doi.org/10.1007/978-3-031-50947-6 to achieve better performance via a higher cache hit rate for each core’s private cache. It can also balance the loads between cores by changing the range of each subset. Note that CARIC-DA is . middleware, which avoids any modification to existing operating systems (OSs) and DBMSs, thereby making 作者: 沒有準(zhǔn)備 時間: 2025-3-25 23:05 作者: 和音 時間: 2025-3-26 03:48
SAQR: An Efficient Scheme for Similarity-Aware Query Refinementlable search space. In particular, SAQR utilizes both similarity-based and cardinality-based pruning techniques to bound the search space and quickly find a refined query that meets the user expectations. Our experimental evaluation shows the scalability exhibited by SAQR under various workload sett作者: cultivated 時間: 2025-3-26 05:11
Concurrent Execution of Mixed Enterprise Workloads on In-Memory Databasesunning queries from execution. A task-based query execution model with priority-based scheduling allows for an effective prioritization of query classes. This paper discusses the impact of task granularity on responsiveness and throughput of an in-memory DBMS. We show that a larger task size for lon作者: MIRE 時間: 2025-3-26 08:53
Linear Path Skyline Computation in Bicriteria Networksoduce a new algorithm to compute all linearly non-dominated paths denoted as linear path skyline. In our experimental evaluation, we will compare our new approach to other methods for computing the linear skyline and efficient approaches to compute path skylines.作者: 胖人手藝好 時間: 2025-3-26 15:18 作者: 愛國者 時間: 2025-3-26 19:14 作者: Femish 時間: 2025-3-26 23:27 作者: 手工藝品 時間: 2025-3-27 04:05
Jacques Corcos,Mikolaj Przydaczd relevance scoring can be an effective tool for data discovery in scientific archives. However, maintaining interactive response times as archives scale will be a challenge. We report here on our exploration of performance techniques for Data Near Here, a dataset search service. We present a sample作者: stress-response 時間: 2025-3-27 06:48 作者: COLIC 時間: 2025-3-27 10:56 作者: cacophony 時間: 2025-3-27 14:06 作者: Missile 時間: 2025-3-27 18:53 作者: Interstellar 時間: 2025-3-28 00:38 作者: 有罪 時間: 2025-3-28 04:23 作者: habitat 時間: 2025-3-28 09:41
Max Ringlstetter,Stephan Kaiser,Tim Kampeve, both application classes issue a database workload with commonly agreed characteristics. However, traditional database management systems (DBMS) are typically optimized for one or the other. Today, we see two trends in enterprise applications that require bridging these two workload categories: 作者: POWER 時間: 2025-3-28 11:05
Amphetamines and Other Stimulant Use,d pivots). There are two basic forms of data partitioning: ball partition and General Hyper-plane (GH) partition. Most existing work only shows their superiority experimentally, and little theoretical proof is found. We propose an approach to unify existing data partitioning methods and analyze thei作者: 不能逃避 時間: 2025-3-28 17:51
Consumer Attitudes Toward Credit Insurancejoin with edit distance constraints. Existing algorithms extract substructures – either rooted trees or simple paths – as features, and transform the edit distance constraint into a weaker count filtering condition. However, the performance suffers from the heavy overlapping or low selectivity of su作者: 低能兒 時間: 2025-3-28 21:03 作者: 粗語 時間: 2025-3-29 01:18 作者: penance 時間: 2025-3-29 04:01 作者: electrolyte 時間: 2025-3-29 07:17 作者: 膠狀 時間: 2025-3-29 11:52
Consumer Behavior During a Brand Crisis In this paper, we introduce a notion of causal time-varying dynamic Bayesian network (CTV-DBN) and define a causal boundary to govern cross time information sharing. Although spatio-temporal data have been investigated by multiple disciplines; by reducing structure discovery into a set of optimizat作者: 躲債 時間: 2025-3-29 16:47
Sustainable Consumer Decision-Makingthe total distance for a given set of shortest path queries on a graph. This problem has important applications in logistics, urban planning, and network planning. We show the NP-hardness of the problem, as well as present efficient algorithms that compute highly accurate results in practice. Experi作者: 增強(qiáng) 時間: 2025-3-29 21:06
Sustainable Consumer Decision-Makingts that are considered preferable by all users. In a na?ve interpretation of MCP, matching degrees between objects and users are aggregated into a single score which ranks objects. Such an approach, though, obscures and blurs individual preferences, and can be unfair, favoring users with precise pre作者: 現(xiàn)暈光 時間: 2025-3-30 01:56 作者: 同音 時間: 2025-3-30 07:06
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263407.jpg作者: 參考書目 時間: 2025-3-30 10:56
https://doi.org/10.1007/978-3-319-05810-8big data; collaborative filtering; collaborative systems; crowdsourcing; data management systems作者: 劇毒 時間: 2025-3-30 14:08
978-3-319-05809-2Springer International Publishing Switzerland 2014作者: 業(yè)余愛好者 時間: 2025-3-30 18:10
Database Systems for Advanced Applications978-3-319-05810-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: mastoid-bone 時間: 2025-3-30 23:08 作者: ULCER 時間: 2025-3-31 03:26
Secure Computation on Outsourced Data: A 10-year RetrospectiveThis paper outlines the “behind the scene” story of how we wrote the DASFAA 2004 paper on secure computation on outsourced data to support SQL aggregation queries. We then describe some of the research we have done following the paper.作者: Anecdote 時間: 2025-3-31 07:22 作者: jettison 時間: 2025-3-31 10:09
Conference proceedings 2014s cover the following topics: big data management, indexing and query processing, graph data management, spatio-temporal data management, database for emerging hardware, data mining, probabilistic and uncertain data management, web and social data management, security, privacy and trust, keyword search, data stream management and data quality.作者: Seminar 時間: 2025-3-31 15:14 作者: 依法逮捕 時間: 2025-3-31 20:21 作者: 成份 時間: 2025-3-31 21:53
Consumer Attitudes Toward Credit Insurance. It is observed under the framework that using either too few or too many substructures can result in poor filtering performance. Thus, we devise an algorithm to select substructures for filtering. The proposed techniques are integrated into the framework, constituting a new algorithm, whose superiority is witnessed by experimental results.
