Scalable linear algebra on a relational database system
نویسندگان
چکیده
منابع مشابه
Scalable Dense Linear Algebra on Heterogeneous Hardware
Design of systems exceeding 1 Pflop/s and the push toward 1 Eflop/s, forced a dramatic shift in hardware design. Various physical and engineering constraints resulted in introduction of massive parallelism and functional hybridization with the use of accelerator units. This paradigm change brings about a serious challenge for application developers, as the management of multicore proliferation ...
متن کاملPennFS: A File System on Relational Database
PennFS, a Windows 8 Store Application, aims to visualize and simplify the user experience of file management by implementing an alternative file system that is better indexed and organized through relational database. The traditional hierarchical file system has several limitations; especially, when files share multiple relational properties, one file may relate to multiple folders, and the pri...
متن کاملRelational Algebra for In-Database Process Mining
The execution logs that are used for process mining in practice are often obtained by querying an operational database and storing the result in a flat file. Consequently, the data processing power of the database system cannot be used anymore for this information, leading to constrained flexibility in the definition of mining patterns and limited execution performance in mining large logs. Ena...
متن کاملImplementing a Scalable XML Publish/Subscribe System Using a Relational Database System
An XML publish/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of this approac...
متن کاملScalable Package Queries in Relational Database Systems
Traditional database queries define constraints that each tuple in the result must satisfy. This model, albeit computationally efficient, does not support many real-world problems that require result tuples to satisfy constraints collectively, rather than individually. Existing work has focused on applicationand domain-specific approaches. Our goal is to create a universal framework to support ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2020
ISSN: 0001-0782,1557-7317
DOI: 10.1145/3405470