Filters








618 Hits in 3.5 sec

Formalizing a Broader Recursion Coverage in SQL [chapter]

Gabriel Aranda, Susana Nieva, Fernando Sáenz-Pérez, Jaime Sánchez-Hernández
2013 Lecture Notes in Computer Science  
In this work, we propose a new approach, called R-SQL, aimed to overcome these limitations and others, allowing in particular cycles in recursive definitions of graphs and mutually recursive relation definitions  ...  We develop a formal framework using a stratified fixpoint semantics and introduce a proof-of-concept implementation.  ...  In this work, we focus on the inclusion of recursion in SQL as current RDBMS's lack both a formal support and suffer a narrow coverage of recursion.  ... 
doi:10.1007/978-3-642-45284-0_7 fatcat:7xaszuzn3fg5pkm7xkbvc5eyju

The Query Translation Landscape: a Survey [article]

Mohamed Nadjib Mami, Damien Graux, Harsh Thakkar, Simon Scerri, Sören Auer, Jens Lehmann
2019 arXiv   pre-print
In particular, we study which query language is a most suitable candidate for that 'universal' query language.  ...  Whereas the availability of data has seen a manyfold increase in past years, its value can be only shown if the data variety is effectively tackled ---one of the prominent Big Data challenges.  ...  Given a SPARQL query, a recursive query generation process is devised yielding a single but nested SQL query.  ... 
arXiv:1910.03118v1 fatcat:wsww5vhlwjhqjlouibetb6mo3a

Piloting Data Engineering at Berkeley

Joseph M. Hellerstein, Aditya G. Parameswaran
2022 1st International Workshop on Data Systems Education  
In the Spring of 2021, we launched a pilot edition of a new Data Engineering course at Berkeley, targeted at our burgeoning Data Science major.  ...  Given constraints on space, this short document focuses largely on the first two of these themes, with a briefer coverage of the last one.  ...  Dataframes and Beyond Next we turn our attention to a model that typically lacks a formalism: dataframes.  ... 
doi:10.1145/3531072.3535324 fatcat:u74qgmmh2rbonju6y326msc3ae

GeoSPARQL+: Syntax, Semantics and System for Integrated Querying of Graph, Raster and Vector Data – Technical Report [article]

Timo Homburg, Steffen Staab, Daniel Janke
2020 arXiv   pre-print
We introduce an approach to semantically represent and query raster data in a Semantic Web graph.  ...  Finally, we describe a prototypical implementation and validate the feasibility of our approach.  ...  definitions given in [35] , are examples for a broader set of possible raster algebra operations.  ... 
arXiv:2009.05032v1 fatcat:abmi76jbfbdqrm6spafnxkkdre

BootOX: Practical Mapping of RDBs to OWL 2 [chapter]

Ernesto Jiménez-Ruiz, Evgeny Kharlamov, Dmitriy Zheleznyakov, Ian Horrocks, Christoph Pinkel, Martin G. Skjæveland, Evgenij Thorstensen, Jose Mora
2015 Lecture Notes in Computer Science  
Ontologies have recently became a popular mechanism to expose relational database (RDBs) due to their ability to describe the domain of data in terms of classes and properties that are clear to domain  ...  in industrial and research contexts.  ...  The results of the query catalog coverage are summarised in Figure 3 (a).  ... 
doi:10.1007/978-3-319-25010-6_7 fatcat:tsr5e6xbvvamdpjqc6o2qzky4u

Interactive parser synthesis by example

Alan Leung, John Sarracino, Sorin Lerner
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
To achieve this, Parsify provides: (a) an iterative algorithm for synthesizing and refining a grammar one example at a time, (b) an interface that provides immediate visual feedback in response to changes  ...  in the grammar being refined, and (c) a graphical mechanism for specifying example parse trees using only textual selections.  ...  This work was supported by the National Science Foundation through grants 1228967, 1219172 and 1423517, and a generous gift from Google.  ... 
doi:10.1145/2737924.2738002 dblp:conf/pldi/LeungSL15 fatcat:cgkxwto3ynczbp7xqvkuugr3pi

Interactive parser synthesis by example

Alan Leung, John Sarracino, Sorin Lerner
2015 SIGPLAN notices  
To achieve this, Parsify provides: (a) an iterative algorithm for synthesizing and refining a grammar one example at a time, (b) an interface that provides immediate visual feedback in response to changes  ...  in the grammar being refined, and (c) a graphical mechanism for specifying example parse trees using only textual selections.  ...  This work was supported by the National Science Foundation through grants 1228967, 1219172 and 1423517, and a generous gift from Google.  ... 
doi:10.1145/2813885.2738002 fatcat:t4k7meqk2fhdpkhfd6b7habtea

Simple and safe SQL queries with c++ templates

Joseph (Yossi) Gil, Keren Lenz
2007 Proceedings of the 6th international conference on Generative programming and component engineering - GPCE '07  
A library of templates and preprocessor directives effectively extends C++ with a little language representing an augmented relational algebra formalism.  ...  ., "expression templates") for compile time representation of symbolic structures, are enhanced in our system to support a type system (featuring structural equivalence) and a symbol table lookup of the  ...  On a broader perspective, our work may be used as a case study by designers of genericity mechanisms in future languages.  ... 
doi:10.1145/1289971.1289976 dblp:conf/gpce/GilL07 fatcat:ufmschmcxzb23erubeabe6ghwm

Simple and safe SQL queries with C++ templates

Joseph (Yossi) Gil, Keren Lenz
2010 Science of Computer Programming  
A library of templates and preprocessor directives effectively extends C++ with a little language representing an augmented relational algebra formalism.  ...  ., "expression templates") for compile time representation of symbolic structures, are enhanced in our system to support a type system (featuring structural equivalence) and a symbol table lookup of the  ...  On a broader perspective, our work may be used as a case study by designers of genericity mechanisms in future languages.  ... 
doi:10.1016/j.scico.2010.01.004 fatcat:hmttvcfsfvdmniv7pxkjxe4ogq

Bridging the Knowledge Gap between Transactional Databases and Data Warehouses

Nenad Jukic, Boris Jukic
2010 Journal of Computing and Information Technology  
This paper examines the issues that have contributed to the lag in the coverage of data warehousing topics at universities.  ...  However, the majority of academic institutions in the US and world-wide have been slow in developing curriculums that reflect this reality.  ...  In many cases, the lack of formal academic education related to data warehousing has left these information systems professionals without a clear and meaningful understanding of the overall purpose of  ... 
doi:10.2498/cit.1001805 fatcat:of7kl7rbtvgj3pz2mdgdsk4xru

Natural Language Interfaces to Databases - An Introduction [article]

I.Androutsopoulos (Dept.of Artificial Intelligence, Univ.of Edinburgh), G.D.Ritchie , P.Thanisch
1995 arXiv   pre-print
A brief overview of the history of NLIDBs is first given.  ...  Some advantages and disadvantages of NLIDBs are then discussed, comparing NLIDBs to formal query languages, form-based interfaces, and graphical interfaces.  ...  The first author is grateful to the Greek State Scholarships Foundation for funding his studies in Edinburgh.  ... 
arXiv:cmp-lg/9503016v2 fatcat:vv6vexlvrrfw5pck5slhvtz6zi

Teaching data modeling

Paul Wagner
2005 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education - ITiCSE '05  
We instead recommend increasing the amount of time spent in the study of data modeling and encourage data model study beyond formalism syntax.  ...  While competition for scarce space in a Database Systems course curriculum increases, the amount of time spent in many such courses on data modeling decreases.  ...  Also, UML is increasingly being used as a data modeling formalism (e.g. [9] ). At the same time, a variety of levels of process coverage are used.  ... 
doi:10.1145/1067445.1067493 dblp:conf/iticse/Wagner05 fatcat:ilonu23pcvgo3mt3xq6svisax4

The evolution of the programming languages course

K. N. King
1992 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education - SIGCSE '92  
recursion could simulate those features in Fortran, say.)  ...  Books will also likely become longer, thanks to the broader coverage suggested by the new curriculum. Today's books, of course, were written before the 1991 curriculum was finished.  ... 
doi:10.1145/134510.134553 dblp:conf/sigcse/King92 fatcat:5du5iuy76netdjqz5foojln2ki

The evolution of the programming languages course

K. N. King
1992 ACM SIGCSE Bulletin  
recursion could simulate those features in Fortran, say.)  ...  Books will also likely become longer, thanks to the broader coverage suggested by the new curriculum. Today's books, of course, were written before the 1991 curriculum was finished.  ... 
doi:10.1145/135250.134553 fatcat:ebhwuqs3jfawbcdikz5rfqi4gi

A Machine-Learning-Driven Evolutionary Approach for Testing Web Application Firewalls

Dennis Appelt, Cu D. Nguyen, Annibale Panichella, Lionel C. Briand
2018 IEEE Transactions on Reliability  
We implemented ML-Driven in a tool and evaluated it on ModSecurity, a widely used open-source WAF, and a proprietary WAF protecting a financial institution.  ...  In this paper, we focus on testing WAFs for SQL injection attacks, but the general principles and strategy we propose can be adapted to other contexts.  ...  In line 14, the recursion ends if the node forms a minimal slice, as defined in Def. 2, otherwise the recursion continues. for all child ∈ children do 5: VISIT(child, root, S) 6: end for 7: return  ... 
doi:10.1109/tr.2018.2805763 fatcat:5iua3xo3rffxxpxfaeaf7pccae
« Previous Showing results 1 — 15 out of 618 results