Scalable Learning to Troubleshoot Query Performance Problems

2021 ◽  
Author(s):  
Alexandar Mihaylov ◽  
Vincent Corvinelli ◽  
Parke Godfrey ◽  
Piotr Mierzejewski ◽  
Jaroslaw Szlichta ◽  
...  

2020 ◽  
Vol 19 (2) ◽  
pp. 63-74
Author(s):  
Klaus Moser ◽  
Hans-Georg Wolff ◽  
Roman Soucek

Abstract. Escalation of commitment occurs when a course of action is continued despite repeated drawbacks (e.g., maintaining an employment relationship despite severe performance problems). We analyze process accountability (PA) as a de-escalation technique that helps to discontinue a failing course of action and show how time moderates both the behavioral and cognitive processes involved: (1) Because sound decisions should be based on (hopefully unbiased) information search, which requires time to gather, the effect of PA on de-escalation increases over time. (2) Because continuing information search creates behavioral commitment, the debiasing effect of PA on information search diminishes over time. (3) Consistent with the tunnel vision notion, the effects of less biased information search on de-escalation decrease over time.



2021 ◽  
Vol 11 (5) ◽  
pp. 2405
Author(s):  
Yuxiang Sun ◽  
Tianyi Zhao ◽  
Seulgi Yoon ◽  
Yongju Lee

Semantic Web has recently gained traction with the use of Linked Open Data (LOD) on the Web. Although numerous state-of-the-art methodologies, standards, and technologies are applicable to the LOD cloud, many issues persist. Because the LOD cloud is based on graph-based resource description framework (RDF) triples and the SPARQL query language, we cannot directly adopt traditional techniques employed for database management systems or distributed computing systems. This paper addresses how the LOD cloud can be efficiently organized, retrieved, and evaluated. We propose a novel hybrid approach that combines the index and live exploration approaches for improved LOD join query performance. Using a two-step index structure combining a disk-based 3D R*-tree with the extended multidimensional histogram and flash memory-based k-d trees, we can efficiently discover interlinked data distributed across multiple resources. Because this method rapidly prunes numerous false hits, the performance of join query processing is remarkably improved. We also propose a hot-cold segment identification algorithm to identify regions of high interest. The proposed method is compared with existing popular methods on real RDF datasets. Results indicate that our method outperforms the existing methods because it can quickly obtain target results by reducing unnecessary data scanning and reduce the amount of main memory required to load filtering results.



2021 ◽  
Vol 50 (1) ◽  
pp. 59-59
Author(s):  
Marcin Zukowski

Hash tables are possibly the single most researched element of the database query processing layers. There are many good reasons for that. They are critical for some key operations like joins and aggregation, and as such are one of the largest contributors to the overall query performance. Their efficiency is heavily impacted by variations of workloads, hardware and implementation, leading to many research opportunities. At the same time, they are sufficiently small and local in scope, allowing a starting researcher, or even a student, to understand them and contribute novel ideas. And benchmark them. . . Oh, the benchmarks. . . :)





2021 ◽  
Vol 145 ◽  
pp. 111067
Author(s):  
John Balfour ◽  
Roger Hill ◽  
Andy Walker ◽  
Gerald Robinson ◽  
Thushara Gunda ◽  
...  




Sign in / Sign up

Export Citation Format

Share Document