Suchergebnisse - database query processing

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy von Jiang, Zihan, Mao, Fubing, Guo, Yapu, Liu, Xu, Liu, Haikun, Liao, Xiaofei, Jin, Hai, Zhang, Wei

“… Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates …”
Volltext

STREAM: Spatiotemporal Similarity-based Efficient Approximate Median with Tunable Granularity von Li, Fenfang, Luo, Huizhang, Liu, Weichen, Chronopoulos, Anthony Theodore, Li, Kenli, Liu, Chubo

“… ) algorithms failing to meet (near) real-time processing demands. While approximate MED algorithm has arisen as a promising candidate, existing approaches ignore …”
Volltext

Compile-Time Analysis of Compiler Frameworks for Query Compilation von Engelke, Alexis, Schwarz, Tobias

“… This not only applies to language runtimes for Java, WebAssembly, or JavaScript, but is also crucial for database systems that employ query compilation as the primary measure for achieving high …”
Volltext

SeIM: In-Memory Acceleration for Approximate Nearest Neighbor Search von Liu, Chaoqiang, Chen, Dan, Huang, Yu, Xiao, Wenjing, Liu, Haifeng, Zhang, Yi, Li, Huize, Liao, Xiaofei, Jin, Hai

“… Approximate nearest neighbor search (ANNS) is crucial in many applications to find semantically similar matches for user queries …”
Volltext

MILLION: MasterIng Long-Context LLM Inference Via Outlier-Immunized KV Product QuaNtization von Wang, Zongwu, Xu, Peng, Liu, Fangxin, Hu, Yiwei, Sun, Qingxiao, Li, Gezi, Li, Cheng, Wang, Xuan, Jiang, Li, Guan, Haibing

“… Large language models (LLMs) are increasingly utilized for complex tasks requiring longer context lengths, with some models supporting up to 128 K or 1 M …”
Volltext

Max-PIM: Fast and Efficient Max/Min Searching in DRAM von Zhang, Fan, Angizi, Shaahin, Fan, Deliang

“… Recently, in-DRAM computing is becoming one promising technique to address the notorious 'memory-wall' issue for big data processing …”
Volltext

Querying Visible and Invisible Information von Benedikt, Michael, Bourhis, Pierre, ten Cate, Balder, Puppis, Gabriele

“… We want to determine which information about a query (a positive existential sentence) can be inferred from the visible instance and the constraints …”
Volltext

Big Data Analytics with Datalog Queries on Spark von Shkapsky, Alexander, Yang, Mohan, Interlandi, Matteo, Chiu, Hsuan, Condie, Tyson, Zaniolo, Carlo

“… ). Our BigDatalog system addresses the problem by providing concise declarative specification of complex queries amenable to efficient evaluation …”
Weitere Angaben

Automatic Detection of Performance Bugs in Database Systems using Equivalent Queries von Liu, Xinyu, Zhou, Qi, Arulrai, Joy, Orso, Alessandro

“… Because modern data-intensive applications rely heavily on database systems (DBMSs), developers extensively test these systems to elim-inate bugs that negatively affect functionality …”
Volltext

In-Situ Cross-Database Query Processing von Gavriilidis, Haralampos, Beedkar, Kaustubh, Quiane-Ruiz, Jorge-Arnulfo, Markl, Volker

“… It is therefore crucial to have effective and efficient cross-database query processing capabilities …”
Volltext

Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? von Fontaine, Gaelle

“… To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent query …”
Volltext

Static Checking of Dynamically Generated Queries in Database Applications von Gould, Carl, Su, Zhendong, Devanbu, Premkumar

“… , can create string representations ofSQL queries and then send the queries, using JDBC, to adatabase server for execution …”
Volltext

Optimal Join Algorithms Meet Top- k von Tziavelis, Nikolaos, Gatterbauer, Wolfgang, Riedewald, Mirek

“… have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output …”
Weitere Angaben

Enumeration of Billions of Maximal Bicliques in Bipartite Graphs without Using GPUs von Pan, Zhe, He, Shuibing, Li, Xu, Zhang, Xuechen, Yin, Yanlong, Wang, Rui, Shou, Lidan, Song, Mingli, Sun, Xian-He, Chen, Gang

“… Maximal biclique enumeration (MBE) is crucial in bipartite graph analysis. Recent studies rely on extensive set intersections on static bipartite graphs to …”
Volltext

CARP: Range Query-Optimized Indexing for Streaming Data von Jain, Ankush, Cranor, Charles D., Zheng, Qing, Settlemyer, Bradley W., Amvrosiadis, George, Grider, Gary A.

“… Efficient range-based analyses on this data can be enabled by reordering it on attributes of interest, but require expensive post-processing sorts to realize the query benefits of reordering …”
Volltext

Automated Generation of Metamorphic Relations for Query-Based Systems von Segura, Sergio, Alonso, Juan C., Martin-Lopez, Alberto, Duran, Amador, Troya, Javier, Ruiz-Cortes, Antonio

“… Searching and displaying data based on user queries is a pervasive feature of most software applications such as information systems, web portals, and web APIs …”
Volltext

Error-controlled Progressive Retrieval of Scientific Data under Derivable Quantities of Interest von Wu, Xuan, Gong, Qian, Chen, Jieyang, Liu, Qing, Podhorszki, Norbert, Liang, Xin, Klasky, Scott

“… The unprecedented amount of scientific data has introduced heavy pressure on the current data storage and transmission systems. Progressive compression has …”
Volltext

Database Query Processing With Database Clients

Volltext

Ethereum query language von Bragagnolo, Santiago, Rocha, Henrique, Denker, Marcus, Ducasse, Stéphane

“… Therefore, we propose the Ethereum Query Language (EQL), a query language that allows users to retrieve information from the blockchain by writing SQL-like queries …”
Volltext

INTERNATIONAL PATENT: SHARMA, PRATIK FILES APPLICATION FOR "MACHINE LEARNING POWERED QUERY PROCESSING TIER OF DATABASE AND OPTIMISING QUERY PROCESSING TIER OF DATABASE"

Volltext