Search

SQL Server 2014 offers a complex security model with overlapping layers of security that help database administrators (DBAs) counter the risks and threats in a manageable way. It is important for DBAs to understand the SQL Server security model so that they can implement the technologies in the way that best fits the needs of their organization and applications. This chapter discusses the SQL Server security hierarchy before demonstrating how to implement security at the instance, database, and object levels.

This chapter provides a detailed description and discussion in how to use Visual Studio.NET 2019 tools and wizards to build simple but efficient database applications without touching complicated coding. It presents a deeper digging in how to develop advanced database applications using runtime objects and focuses only on the data query applications. A data query will be executed via a dynamic Oracle statement that is built during the configuration of each TableAdapter in the Data Source wizard. When building a Windows Forms App (.NET Framework) application that needs to interface to database, a powerful and simple way is to use the design tools and wizards provided by Visual Studio.NET. The chapter illustrates how to utilize design tools and wizards to build a data‐driven application using our project SelectWizard Project. The Language Integrated Query LINQ To DataSet method is an updated method provided by .NET Framework.

Language-integrated query (LINQ) frameworks offer a convenient programming abstraction for processing in-memory collections of data, allowing developers to concisely express declarative queries using general-purpose programming languages. Existing LINQ frameworks rely on the well-defined type system of statically-typed languages such as C # or Java to perform query compilation and execution. As a consequence of this design, they do not support dynamic languages such as Python, R, or JavaScript. Such languages are however very popular among data scientists, who would certainly benefit from LINQ frameworks in data analytics applications. In this work we bridge the gap between dynamic languages and LINQ frameworks. We introduce DynQ, a novel query engine designed for dynamic languages. DynQ is language-agnostic, since it is able to execute SQL queries in a polyglot language runtime. Moreover, DynQ can execute queries combining data from multiple sources, namely in-memory object collections as well as on-file data and external database systems. Our evaluation of DynQ shows performance comparable with equivalent hand-optimized code, and in line with common data-processing libraries and embedded databases, making DynQ an appealing query engine for standalone analytics applications and for data-intensive server-side workloads.

INTRODUCTION This article explains the design, construction and energy strategies of LINQ, a netzero energy building that was successfully entered into the Solar Decathlon Middle East 2018 held in Dubai. Students of engineering, building physics, architecture and urban planning designed, built and operated LINQ. It is mainly powered by solar energy and made of bio-materials. Some of LINQ's innovations are the ventilated façade with customizable bio-based tiles, the indirect evaporative water cooling system, and the light building integrated photovoltaic-thermal system. LINQ sent more energy to the grid than it drew throughout the competition. However, energy production could have been improved according to simulations and technical specifications. LINQ is a good example of current and future building expectations—combining multiple criteria, strategies, and solutions—to contribute to environmental, social and economic sustainability.

In this chapter, we are going to learn how to use queries in complex scenarios to get the data we want. To this point, we’ve worked with the database in a fairly superficial manner. As this is a book on practical application of the concepts, we really need to experience working with data in real-world scenarios.

Developers of reusable software elements, such as libraries, usually have the responsibility to provide comprehensive and high quality documentation to enable eective reuse of those elements. The eective reuse of libraries depends upon the quality of the API (Application Program Interface) documentation. Well established libraries typically have comprehensive API documentation, for example in Javadocs. However, they also typically lack examples and explanations, which may dicult the eective reuse of the library. StackOverow.com (SO) is a Question and Answer service directed to issues related to software development. In SO, a developer can post questions related to a programming topic and other members of the site can provide answers to help him/her solve the problem he/she has at hand. Despite of the increasing use of SO by the software development community, the information related to a particular library is spread along the website. Thus, SO still lacks an organization of its crowd knowledge. In this dissertation, we present a semi-automatic approach that organizes the information available on SO in order to build a kind of documentation for APIs, called cookbooks (recipe-oriented books). The cookbooks generated by the approach are called crowd cookbooks. In order to evaluate the proposed approach, cookbooks were generated for three APIs widely used by the software development community: SWT,LINQ and QT. Desired features that cookbooks must meet were identied and a study with human subjects was conducted to assess to what extent the generated cookbook meet those features. Through the study it was also possible to identify what is the perceived usefulness by the subjects in relation to the use of cookbooks in APIs learning. The results showed that the cookbooks built using the proposed strategy, in general, meet the identied features. Furthermore, most human subjects considered that cookbooks do not have an appropriate format to the learning of APIs. Desenvolvedores de elementos reusáveis de software, como as bibliotecas, em geral têm a responsabilidade de disponibilizar documentação abrangente e de alta qualidade para permitir o reuso efetivo desses elementos. O reuso efetivo de bibliotecas depende da qualidade da documentação da API (Interface para Programação de Aplicativos). Bibliotecas bem estabelecidas tipicamente têm documentação abrangente, por exemplo em Javadocs. Porém, essa documentação geralmente carece de exemplos e explicações, o que pode dicultar o reuso efetivo da biblioteca. Stackoverow.com (SO) é um serviço de perguntas e respostas (Q&A) direcionado a questões relacionadas ao desenvolvimento de software. No SO, um desenvolvedor pode postar perguntas relacionadas a um tópico de programação e outros membros do site podem disponibilizar respostas para ajudá-lo a resolver o problema que ele tem em mãos. Apesar da utilização crescente do SO pela comunidade de desenvolvimento de software, a informação relação a um biblioteca está espalhada ao longo do site. Assim, o SO ainda carece de uma organização do crowd knowledge nele contido. Nessa dissertação, será apresentada uma abordagem semi-automatizada que organiza a informação disponível no SO para a construção de um tipo de documentação para APIs, conhecido por cookbooks (livros orientados a receitas). Os cookbooks produzidos pela abordagem proposta são chamados crowd cookbooks. Para avaliar a abordagem proposta foram gerados cookbooks para três APIs amplamente utilizadas pela comunidade de desenvolvimento de software: SWT, LINQ e QT. Foram identicadas características desejáveis de cookbooks e realizado um estudo com sujeitos humanos para entender em que grau os cookbooks construídos atendem a estas características. Por meio estudo também foi possível compreender melhor os pers de uso dos cookbooks mais apropriados em relação ao aprendizado de APIs. Os resultados mostraram que os cookbooks construídos pela estratégia proposta, em geral, atendem às características identicadas. Além disso, a maior parte dos sujeitos humanos considerou que cookbooks não possuem um formato adequado ao aprendizado de APIs. Mestre em Ciência da Computação

The rise of streaming libraries such as Akka Stream, Reactive Extensions, and LINQ popularized the declarative functional style of data processing. The stream paradigm offers concise syntax to write down processing pipelines to consume the vast amounts of real-time data available today. These libraries offer the programmer a domain specific language (DSL) embedded in the host language to describe data streams. These libraries however, all suffer from extensibility issues. The semantics of a stream is hard-coded into the DSL language and cannot be changed by the user of the library. We introduce an approach to modify the semantics of a streaming library by means of meta-programming at both run-time and compile-time, and showcase its generality. We show that the expressiveness of the meta-facilities is strong enough to enable push and pull semantics, error handling, parallelism, and operator fusion. We evaluate our work by implementing the identified shortcomings in terms of a novel stream meta-architecture and show that its design and architecture adhere to the design principles of a meta-level architecture. The state of the art offers plenty of choice to programmers regarding reactive stream processing libraries. Expressing reactive systems is otherwise difficult to do in general purpose languages. Extensibility and fine-tuning should be possible in these libraries to ensure a broad variety of applications can be expressed within this single DSL.

Objective: To develop a Web-based Operations Management System, through technologies such as Coolite and LINQ, to systematically manage processes in the Crafting Industry. Methods/Analysis: As part of the software development methodology, XP (Extreme Programming) was used across all its phases. This allowed to clearly determining the necessary requirements for the development of an accessible, scalable and secure application (Web-based Operations Management System) that could fulfil all the functionalities raised by the stakeholders. Findings: The theoretical-scientific framework that supports the research, as well as the elements that allowed an appropriate development of the application, were established. Applications/Improvement: To improve processes within the Crafting Industry, a Web-based Operations Management System, based on technologies such as Coolite and LINQ, was developed. Inherently and more importantly, the application of these technologies allowed for a more accessible and adaptable user interface. Keywords: Coolite, Crafting Industry, LINQ, Management, Process

Language-integrated query based on comprehension syntax is a powerful technique for safe database programming, and provides a basis for advanced techniques such as query shredding or query flattening that allow efficient programming with complex nested collections. However, the foundations of these techniques are lacking: although SQL, the most widely-used database query language, supports heterogeneous queries that mix set and multiset semantics, these important capabilities are not supported by known correctness results or implementations that assume homogeneous collections. In this paper we study language-integrated query for a heterogeneous query language $$\mathcal {NRC}_{\lambda }( Set,Bag )$$ NRC λ ( S e t , B a g ) that combines set and multiset constructs. We show how to normalize and translate queries to SQL, and develop a novel approach to querying heterogeneous nested collections, based on the insight that “local” query subexpressions that calculate nested subcollections can be “lifted” to the top level analogously to lambda-lifting for local function definitions.

This chapter covers in-memory databases along with some other new technologies and paradigms that radically depart from the traditional disk-based rowstore architecture and query-processing algorithms that most relational databases have been using for a few decades now. Current relational databases were architected back in the late 1970s, when hardware was totally different from what it is today and databases were too large to fit in memory and assumed to be kept on disk. In addition to faster processors and declining memory cost, memory capacity in current hardware has increased in a way that most transactional database can now entirely fit into it.

Properly configuring SQL Server is of paramount importance for the performance of your databases and applications. Even when the product has been updated throughout the years to ensure it has the best possible configuration by default, there are still multiple cases, especially for high- performance workloads, in which additional configurations and optimizations may be required.

This chapter covers storage from the SQL Server point of view and, although other factors such as availability and recoverability play a very important role in selecting and configuring storage, we focus mostly on performance. Disk is traditionally the slowest component in a database system, so tuning storage for performance is essential and usually comes in two high level areas: directly tuning the storage and tuning the components to make efficient use of the storage. The first area refers to tuning and configuring the storage hardware itself, while the second one relates to tuning the other components of the system to make optimal use of the storage and includes items such as proper SQL Server configuration and creating the right indexes.

Language-integrated query has attracted much attention from researchers and engineers. It enables one to write a database query with high-level abstractions, which makes it possible to compose, iterate, and reuse queries. An important issue in language-integrated query is the N+1 query problem, and Cheney et al. proposed a program-transformation approach to solve it for a core language of Microsoft’s LINQ. In our previous work, we extended their language to grouping (GROUP BY in SQL) and aggregate functions, and showed that any term can be transformed to a single SQL query. It still has a problem in that the resulting queries may be unnecessarily large and inefficient. This paper solves the problem. Our key idea is re-organization of queries with nested control structures. While our previous work decomposes grouping into finer primitives before transformation, the new algorithm fuses nested control structures after transformation, while keeping the absence of nested data structures. Our algorithm also eliminates correlated subqueries as much as possible, to obtain better performance. We have conducted performance measurements, which shows that our new algorithm reduces the size of generated queries and improves the performance for several examples.

Monadic comprehensions reign over the realm of language-integrated query (LINQ), and for good reasons. Indeed, comprehensions are tightly integrated with general purpose programming languages and close enough to common query languages, such as SQL, to guarantee their translation into effective queries. Comprehensions also support features for writing reusable and composable queries, such as the handling of nested data and the use of functional abstractions. In parallel to these developments, optics have emerged in recent years as the technology of choice to write programs that manipulate complex data structures with nested components. Optic abstractions are easily composable and, in principle, permit both data access and updates. This paper attempts to exploit the notion of optic for LINQ as a higher-level language that complements comprehension-based approaches. In order to do this, we lift a restricted subset of optics, namely getters, affine folds and folds, into a full-blown DSL. The type system of the resulting language of optics, that we have named Optica, distills their compositional properties, whereas its denotational semantics is given by standard optics. This formal specification of the concept of optic enables the definition of non-standard optic representations beyond van Laarhoven, profunctor optics, etc. In particular, the paper demonstrates that a restricted subset of XQuery can be understood as an optic representation; it introduces Triplets, a non-standard semantic domain to normalize optic expressions and facilitate the generation of SQL queries; and it describes how to generate comprehension-based queries from optic expressions, thus showing that both approaches can coexist. Despite the limited expressiveness of optics in relation to comprehensions, results are encouraging enough to anticipate the convenience and feasibility of extending existing comprehension-based libraries for LINQ in the functional ecosystem, with optic capabilities. In order to show this potential, the paper also describes S-Optica, a Scala implementation of Optica using the tagless-final approach.

Language-integrated query adds to database query the power of high-level programming languages such as abstraction, compositionality, and nested data structures. Cheney et al. designed a two-level typed language for it and showed that any closed term of suitable type can be normalized to a single SQL query which does not have nested data structures nor nested SELECT clauses.

Item does not contain fulltext Eye movement tracking systems offer the opportunity to observe and study a complex cognitive process such as programming. As a consequence of the growing number of program systems, software developers need to be able to use more and more programming technologies effectively. The paper analyses one of the possibilities of the C# programming language, the two types of the Language-Integrated Query data abstraction layer, that is the readability and comprehensibility of query and method syntax-based queries by evaluating the knowledge level and evaluating eye movement parameters. 2020 11th IEEE International Conference on Cognitive Infocommunications (CogInfoCom) (Mariehamn, Finland, 23-25 Sept. 2020)

A revolution is defined as a forcible approach for advancement of existing results or introduction of new results. LINQ, for example, signified a revolution in programming languages. Cloud servers are a revolution when compared with on-premises servers. Smart watches could herald a revolution in health care. A decade ago, we never imagined measuring our blood pressure and heart rate without visiting a clinic. In this chapter, you’ll be introduced to today’s industry and how it evolves over the period. You’ll also learn about Internet of Things (IoT) and Industrial Internet of Things (IIoT).

Nowadays, the data are available in a variety of formats such as relational data-base tables, xml files, rdf files or simply text files. Database systems have their own query languages and tools for the manipulation of data. On the other hand, most of todays applications are created in languages based on the object-oriented paradigm. From the level of the programming language it is important to use different sources of data in a uniform manner. The paper discusses the elements of the various query languages such as SQL XQuery or SPARQL. And then shows the capabilities of LINQ and its role in the creation of abstract data access layer. Then the possibilities of LINQ extension are discussed. As the example, design and implementation of LINQ provider for Allegro is presented.

To write code, developers stitch together patterns, like API protocols or data structure traversals. Discovering these patterns can identify inconsistencies in code or opportunities to replace these patterns with an API or a language construct. We present coiling , a technique for automatically mining code for semantic idioms: surprisingly probable, semantic patterns. We specialize coiling for loop idioms, semantic idioms of loops. First, we show that automatically identifiable patterns exist, in great numbers, with a large-scale empirical study of loops over 25MLOC. We find that most loops in this corpus are simple and predictable: 90 percent have fewer than 15LOC and 90 percent have no nesting and very simple control. Encouraged by this result, we then mine loop idioms over a second, buildable corpus. Over this corpus, we show that only 50 loop idioms cover 50 percent of the concrete loops. Our framework opens the door to data-driven tool and language design, discovering opportunities to introduce new API calls and language constructs. Loop idioms show that LINQ would benefit from an Enumerate operator. This can be confirmed by the exitence of a StackOverflow question with 542k views that requests precisely this feature.

Most data sources in real-life are not static but change their information in time. This evolution of data in time can give valuable insights to business analysts. Temporal data refers to data, where changes over time or temporal aspects play a central role. Temporal data denotes the evaluation of object characteristics over time. One of the main unresolved problems that arise during the data mining process is treating data that contains temporal information. Temporal queries on time evolving data are at the heart of a broad range of business and network intelligence applications ranging from consumer behaviour analysis, trend analysis, temporal pattern mining, and sentiment analysis on social media, cyber security, and network monitoring. Social networks (SN) such as Facebook, twitter, LinkedIn contains huge amount of temporal information. Social media forms a dynamic and evolving environment. Similar to real-world friendships, social media interactions evolve over time. People join or leave groups; groups expand, shrink, dissolve, or split over time. Studying the temporal behaviour of communities is necessary for a deep understanding of communities in social media(SM). In this paper we focus on the use of temporal data and temporal data mining in social networks.

Native functional-style querying extensions for programming languages (e.g., LINQ or Java 8 streams) are widely considered as declarative. However, their very limited degree of optimisation when dealing with local collection processing contradicts this statement. We show that developers constructing complex LINQ queries or combining queries expose themselves to the risk of severe performance deterioration. For an inexperienced programmer, a way of getting an appropriate query form can be too complicated. Also, a manual query transformation is justified by the need of improving performance, but achieved at the expense of reflecting an actual business goal. As a result, benefits from a declarative form and an increased level of abstraction are lost.In this paper, we claim that moving of selected methods for automated optimisation elaborated for declarative query languages to the level of imperative programming languages is possible and desired. Our approach is based on the assumption that programmer is able distinguish whether a language-integrated query is intentionally used to introduce some side-effects or its sole purpose is to only query the data. We propose two optimisation procedures through query unnesting designed to avoid unnecessary multiple calculations in collection-processing constructs based on higher-order functions. We have implemented and verified this idea as a simple proof-of-concept LINQ optimiser library.

Provenance, or information about the origin or derivation of data, is important for assessing the trustworthiness of data and identifying and correcting mistakes. Most prior implementations of data provenance have involved heavyweight modifications to database systems and little attention has been paid to how the provenance data can be used outside such a system. We present extensions to the Links programming language that build on its support for language-integrated query to support provenance queries by rewriting and normalizing monadic comprehensions and extending the type system to distinguish provenance metadata from normal data. The main contribution of this article is to show that the two most common forms of provenance can be implemented efficiently and used safely as a programming language feature with no changes to the database system., Comment: Accepted to Science of Computer Programming special issue on PPDP 2016

List comprehensions are a widely used programming construct, in languages such as Haskell and Python and in technologies such as Microsoft's Language Integrated Query. They generalize from lists to arbitrary monads, yielding a lightweight idiom of imperative programming in a pure functional language. When the monad has the additional structure of a so-called ringad, corresponding to "empty" and "union" operations, then it can be seen as some kind of collection type, and the comprehension notation can also be extended to incorporate aggregations. Ringad comprehensions represent a convenient notation for expressing database queries. The ringad structure alone does not provide a good explanation or an efficient implementation of relational joins; but by allowing heterogeneous comprehensions, involving both bag and indexed table ringads, we can accommodate these too.

The conservativity theorem for nested relational calculus implies that query expressions can freely use nesting and unnesting, yet as long as the query result type is a flat relation, these capabilities do not lead to an increase in expressiveness over flat relational queries. Moreover, Wong showed how such queries can be translated to SQL via a constructive rewriting algorithm. While this result holds for queries over either set or multiset semantics, to the best of our knowledge, the questions of conservativity and normalization have not been studied for queries that mix set and bag collections, or provide duplicate-elimination operations such as SQL's $\mathtt{SELECT}~\mathtt{DISTINCT}$. In this paper we formalize the problem, and present partial progress: specifically, we introduce a calculus with both set and multiset collection types, along with natural mappings from sets to bags and vice versa, present a set of valid rewrite rules for normalizing such queries, and give an inductive characterization of a set of queries whose normal forms can be translated to SQL. We also consider examples that do not appear straightforward to translate to SQL, illustrating that the relative expressiveness of flat and nested queries with mixed set and multiset semantics remains an open question., Comment: DBPL 2019 -- short paper

Language-integrated provenance builds on language-integrated query techniques to make provenance information explaining query results readily available to programmers. In previous work we have explored language-integrated approaches to provenance in Links and Haskell. However, implementing a new form of provenance in a language-integrated way is still a major challenge. We propose a self-tracing transformation and trace analysis features that, together with existing techniques for type-directed generic programming, make it possible to define different forms of provenance as user code. We present our design as an extension to a core language for Links called LinksT, give examples showing its capabilities, and outline its metatheory and key correctness properties., Comment: DBPL 2019

Well established libraries typically have API documentation. However, they frequently lack examples and explanations, possibly making difficult their effective reuse. Stack Overflow is a question-and-answer website oriented to issues related to software development. Despite the increasing adoption of Stack Overflow, the information related to a particular topic (e.g., an API) is spread across the website. Thus, Stack Overflow still lacks organization of the crowd knowledge available on it. Our target goal is to address the problem of the poor quality documentation for APIs by providing an alternative artifact to document them based on the crowd knowledge available on Stack Overflow, called crowd cookbook. A cookbook is a recipe-oriented book, and we refer to our cookbook as crowd cookbook since it contains content generated by a crowd. The cookbooks are meant to be used through an exploration process, i.e. browsing. In this paper, we present a semi-automatic approach that organizes the crowd knowledge available on Stack Overflow to build cookbooks for APIs. We have generated cookbooks for three APIs widely used by the software development community: SWT, LINQ and QT. We have also defined desired properties that crowd cookbooks must meet, and we conducted an evaluation of the cookbooks against these properties with human subjects. The results showed that the cookbooks built using our approach, in general, meet those properties. As a highlight, most of the recipes were considered appropriate to be in the cookbooks and have self-contained information. We concluded that our approach is capable to produce adequate cookbooks automatically, which can be as useful as manually produced cookbooks. This opens an opportunity for API designers to enrich existent cookbooks with the different points of view from the crowd, or even to generate initial versions of new cookbooks., Comment: Accepted at Information and Software Technology - Journal - Elsevier. 16 pages

As location-aware information becomes more popular, many researchers have been proposed many effective approaches to solving the problem. In this work, we identify the shortcomings of the existing method from the LINQ framework as our baseline. After that, an efficient method called Multi-IRS is proposed to optimise the query search at runtime. Our analysis points out how optimisation could be done. Multi-IRS makes use of the improved algorithm that addresses numeric and textual attributes. After that, the sparse ordered set is proposed to reduce the index construction time. Finally, the external attribute-based IR-tree sort algorithm is proposed to solve the scalability issues. Throughout the extensive experiments, our proposed method significantly outperforms the baseline algorithm.

This paper presents the accompanying Teaching Notes for “International AC: An Education Case on Continuous Monitoring SQL Server Data with ODBC-Linked Tables in Microsoft Access.” The purpose of these Teaching Notes is to prepare the faculty member to present the case in a classroom or online environment. Also, the Teaching Notes contain suggested solutions for the ten discussion questions that are presented at the end of the case, along with examples of the continuous monitoring results that students should copy and paste into the Word document they submit to the faculty member. Appendix A contains instructions that the learning institution's systems specialists or database administrator (DBA) use to create the customer, inventory, and sales_order student tables in Microsoft SQL Server and to enter abnormalities in these tables during the assigned week when students will be performing continuous monitoring. Students will establish ODBC connections from their Access database to these SQL Server ...

This article focuses on testing a path-oriented querying approach to hierarchical data in relational databases. The authors execute a user study to compare the path-oriented approach and traditional SQL from two perspectives: correctness of queries and time spent in querying. They also analyze what kinds of errors are typical in path-oriented SQL. Path-oriented query languages are popular in the context of object-orientation and XML. However, relational databases are the most common paradigm for storing data and SQL is most common for manipulating data. When querying hierarchical data in SQL, the user must specify join conditions explicitly between hierarchy levels. Path-oriented SQL is a new alternative for expressing hierarchical queries in relational databases. In the authors' study, the users spent significantly less time in writing path-oriented SQL queries and made fewer errors in query formulation.

SQL injection attacks have been predominant on web databases since the last 15 years. Exploiting input validation flaws, attackers inject SQL code through the front-end of websites and steal data from the back-end databases. Detection of SQL injection attacks has been a challenging problem due to extreme heterogeneity of the attack vectors. In this paper, we present a novel approach to detect injection attacks by modeling SQL queries as graph of tokens and using the centrality measure of nodes to train a Support Vector Machine (SVM). We explore different methods of creating token graphs and propose alternative designs of the system comprising of single and multiple SVMs. The system is designed to work at the database firewall layer and can protect multiple web applications in a shared hosting scenario. Though we focus primarily on web applications developed with PHP and MySQL, the approach can be easily ported to other platforms. The experimental results demonstrate that this technique can effectively identify malicious SQL queries with negligible performance overhead.

injection attacks are often found within the dynamic pages of a web application that exploit the security vulnerability of the database layers of an application. In this attack category a specifically crafted SQL command is entered in the form field of a web application instead of the expected information. SQL injection takes advantages of the design flaws in poorly designed web applications to poison SQL statements and bypass the normal methods of accessing the database content .In these types of Injection attempt the database server execute undesirable SQL Code to steal, manipulate or delete the content of a database. The proposed algorithm is implemented on an application which is placed on a proxy server kept between the Database server and a web server. It is working on multi-level template based approach, which is a model based approach to detect the illegal queries before they are executed on the database server. With the support of the query evaluation engine it can detect and block the injected query. Only the benign query is allowed to get the access to the back end database server. An alert message is generated if there is an Injection.

Structured Query Language (SQL) is widely used to operate Relational Databases (RDBs), and to operate an RDB with SQL, an application called an SQL Client is used. Recently, many SQL Clients have been developed and have become more users friendly. An SQL Client is very useful for learning SQL, but it is not designed for the classroom. There are some problems associated with classroom use. One problem is that the teacher cannot monitor the learner's progress, and in any case, it is difficult to add such a function to an SQL Client. In this paper, we propose a method for gathering information for monitoring study progress on the RDB side using an Audit Log. With this method, learners can use any SQL Client. We have developed an experimental system to implement this method and evaluate its use in the classroom.

Modelling information flows enable us to understand organisational communication and manage dynamics of business functions. LINQ is a new technique for modelling organisational information flows. Our previous work has showed that the technique can capture the dynamics of information flows. However, there is still a need to facilitate LINQ with formulations of business rules. Fulfilling this gap, the current study extends LINQ with the norm analysis method. The norm analysis defines business rules, conditions and constrains for controlling information flows. The extended LINQ has been applied to a real case study for demonstration purposes. The obtained results suggest that the extended technique enables analysists to model information flows and accommodate conditional business rules.

Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs. LINQ and ORM can be used for the integration, but they have issues with flexibility: query decomposition and reusing of subqueries are a challenge. Adaptation of parser combinators technique for paths querying may solve these problems. Conventional parser combinators process linear input, and only the Trails library is known to apply this technique for path querying. Trails suffers the common parser combinators issue: it does not support left-recursive grammars and also experiences problems in cycles handling. We demonstrate that it is possible to create general parser combinators for CFPQ which support arbitrary context-free grammars and arbitrary input graphs. We implement a library of such parser combinators and show that it is applicable for realistic tasks.

One of the benefits of Language Integrated Query (LINQ) is that compilers can validate the instructions at design time. However, there are some real-world cases in which the executing command is not completely established at design time, for example, because the user selects from a number of drop-down filters on a screen. This chapter shows ways to make LINQ commands dynamic partially or fully in conjunction with Entity Framework Core.

Like the classic Entity Framework, Entity Framework Core allows you to write database queries with Language Integrated Query (LINQ).

If LINQ and the Entity Framework Core API are not sufficient in terms of functionality or performance, you can send any SQL commands directly to the database, including invoking stored procedures and using table-value functions (TVFs).

Designed heterogeneous data sources for a hybrid version of the TPC-H enterprise.Developed hybrid LINQ queries over the relational and XML data sources.Evaluated the hybrid benchmark for loosely-coupled distributed data sources.Assessed query performance for two database products with various options. There are known benchmarks for the performance evaluation of relational and XML databases. However, there is an increasing demand for database applications that require access to heterogeneous loosely-coupled distributed data sources. This paper presents a hybrid benchmark based on TPC-H where the data sources are heterogeneous. Specifically, the paper describes the design of the relational and XML data sources as well as the query redesign in the LINQ query language, which supports queries over heterogeneous data sources. The results of a performance evaluation of the hybrid benchmark over various database products is included for untyped and typed XML with and without clearing the database cache.

Aims Implantable cardiac monitors (ICMs) are used for long-term heart rhythm monitoring, e.g. to diagnose unexplained syncope or for detection of suspected atrial and ventricular arrhythmias. The newest ICM, Reveal LINQ™ (Medtronic Inc.), is miniaturized and inserted with a specific insertion tool kit. The procedure is therefore minimally invasive and can be moved from catheterization laboratory (cath lab) to a less resource intensive setting. This study aims to assess the change in procedure costs when performed outside the cath lab. Methods and results A bottom-up costing methodology was used. Data were collected from interviews with physicians, cath lab managers, and financial controllers. Hospitals in the Netherlands, France, and the UK were included in this study. The cost comparison of a Reveal XT implantation in a cath lab setting vs. a Reveal LINQ insertion outside a cath lab resulted in an estimated reduction of €662 for the UK, €682 for the Netherlands, and €781 for France. These cost savings were primarily realized through fewer staff, less equipment, and overhead costs. The net effect on savings depends on the price differential between these two technologies. The patient care pathway can be improved due to the possibility to move the procedure out of the cath lab. Conclusion Inserting the miniaturized version of the ICM is simpler and faster, and the procedure can take place outside the cath lab in a less resource intensive environment. Hospitals save resources when the higher price of the Reveal LINQ does not outweigh these savings.

This paper studies the generic location-aware rank query (GLRQ) over a set of location-aware objects. A GLRQ is composed of a spatial location, a set of keywords, a query predicate, and a ranking function formulated on location, text and other attributes. The result consists of $k$ objects satisfying the predicate ranked according to the ranking function. An example is a query searching for the restaurants that 1) are nearby, 2) offer “American” food, and 3) have high ratings (rating $>$ 4.0). Such queries can not be processed efficiently using existing techniques. In this work, we propose a novel framework called LINQ for efficient processing of GLRQs. To handle the predicate and the attribute-based scoring, we devise a new index structure called synopses tree , which contains the synopses of different subsets of the dataset. The synopses tree enables pruning of search space according to the satisfiability of the predicate. To process the query constraints over the location and keywords, the framework integrates the synopses tree with the spatio-textual index such as IR-tree. The framework therefore is capable of processing the GLRQs efficiently and holistically. We conduct extensive experiments to demonstrate that our solution provides excellent query performance.