Abstract
In recent years, Datalog has gained popularity for the implementation of advanced data analysis. Applications benefit from Datalog's high-level, declarative syntax, and availability of efficient algorithms for computing solutions. The efficiency of Datalog engines has reached a point where engines such as Soufflé have reported performance results comparable to low-level hand-crafted alternatives [3].
- Serge Abiteboul, Richard Hull, and Victor Vianu (Eds.). 1995.
Foundations of Databases: The Logical Level (1st ed.). Addison-Wesley Longman Publishing Co., Inc. Google ScholarDigital Library
- Goetz Graefe. 2010. A survey of B-tree locking techniques.
ACM Transactions on Database Systems (TODS) 35, 3 (2010), 16. Google ScholarDigital Library
- Herbert Jordan, Bernhard Scholz, and Pavle Subotić. 2016. Soufflé: On Synthesis of Program Analyzers. In
International Conference on Computer Aided Verification .Google Scholar - Christoph Lameter. 2005. Effective synchronization on Linux/NUMA systems. In
Gelato Conference , Vol. 2005.Google Scholar - J. Whaley, D. Avots, M. Carbin, and M. S. Lam. 2005. Using Datalog with binary decision diagrams for program analysis. In
APLAS . 97--118. Google ScholarDigital Library
Index Terms
(auto-classified)Two concurrent data structures for efficient datalog query processing
Recommendations
Two concurrent data structures for efficient datalog query processing
PPoPP '18: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingIn recent years, Datalog has gained popularity for the implementation of advanced data analysis. Applications benefit from Datalog's high-level, declarative syntax, and availability of efficient algorithms for computing solutions. The efficiency of ...
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
On efficient reverse k-skyband query processing
DASFAA'12: Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part IThis paper, for the first time, addresses the problem of efficient reverse k-skyband (RkSB) query processing. Given a set P of multi-dimensional points and a query point q, an RkSB query returns all the points in P whose dynamic k-skyband contains q. We ...







Comments