Structured Query Language

Many algorithms have been devised for minimizing the costs associated with obtaining the answer to a single, isolated query in a distributed database system. However, if more than one query may be processed by the system at the same time and if the arrival times of the queries are unknown, the determination of optimal query-processing strategies becomes a stochastic optimization problem. In order to cope with such problems, a theoretical state-transition model is presented that treats the system as one operating under a stochastic load. Query-processing strategies may then be distributed over the processors of a network as probability distributions, in a manner which accommodates many queries over time. It is then shown that the model leads to the determination of optimal query-processing strategies as the solution of mathematical programming problems, and analytical results for several examples are presented. Furthermore, a divide-and-conquer approach is introduced for decomposing ...

Semantic Binary Object-oriented Data Model (Sem-ODM) provides an expressive data model (similar to Object-oriented Data Models) with a well-known declarative query facility - SQL (similar to relational databases). Advantages of using Sem-ODM include (i.) friendlier and more intelligent generic user interfaces; (ii.) comprehensive enforcement of integrity constraints; (iii.) greater flexibility; (iv.) substantially shorter application programs; and (v.) easier query facility.

XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community and the text and documents community. As an inconvenient, the grammar used to define XQuery is thus very complex and leads to several equivalent query expressions for one same query. This complexity often discourages XQuery-based software developers and designers and leads to incomplete XQuery handling. Works have been done in [DPX04] and especially in [Che04] to reduce equivalent forms of XQuery expressions into identified "canonical forms". However, these works do not cover the whole XQuery specification. We propose in this paper to extend these works in order to canonize the whole untyped XQuery specification.

Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex and chain complex morphism is defined and used for storing cw-complexes and their morphisms, hence instances of building projects and different views upon them, into relational databases. In many cases, this can be done without loss of topological information. The equivalence of categories between sets with binary relations and Alexandrov spaces is proven and used to incorporate the relational complexes into the more general setting of topological databases. For the latter, a topological version of a relational query language is defined by transferring the usual relational algebra operators into topological constructions. In the end, it is proven that such a topological version of relational algebra in general must be able to compute the transitive closure of a relation.

A unusual technique construction to serve exquisite RDF dissolutions in sizable. Novel data arrangement strategies to co-locate semantically associated bits of data. Within this report, we recount RpCl, a decent and expandable dispersed RDF data supervision technique yet perplex. Unlike soon approaches, RpCl runs a corporeal evaluation of both proof and dummy instruction fronting separationing the science. The machinery keeps a sliding-window w tracking the modern good position for the load, counting associated data nearby in spite of joins that necessary ultimate performed and also the convicting edges. The structure combines join along pruning via RDF linear representation portrayal having a locality- stationed, even dissolutioning from the triples correct into a grid like, shared ratio organization. The Important Thing Index is a basic indicant in RpCl it utilizes a lexicovisual representationical tree to inspect each elect URI or accurate and select it a weird product key qualit...

In this paper we present a Bayesian approach to language identification of queries sent to an information retrieval system. The aim of the work is to identify both the language of a query as a whole and the language of particular words in the query. The method is evaluated on a test set of manually labelled queries. The evaluation shows that our method performs better than the Google Language Detect API and an implementation of the n-gram method on our testing set of queries.

Abstract—Access to Web data has become an integral part of many applications and services. In the past, such data has usually been accessed through human-tailored HTML interfaces. Nowadays, rich client interfaces in desktop applications or, increasingly, in browser-based clients ease data access and allow more complex client processing based on XML or RDF data retrieved through Web service interfaces. Convenient speci cations of the data processing on the client and exible, expressive service interfaces for data access ...

In recent years, many non-expert user applications have been developed to query Geographic Information Systems (GIS) that are used to browse and view data about space and time thus naming them spatio-temporal databases. Our research aims at designing and developing an International Visual Query Language (IVQL) that allows users to query databases based on their location. The databases are installed on a GIS server computer. The queries are sent to the server from a mobile phone through the Short Messages System (SMS). With the emerging Globalization of user interfaces, IVQL is meant to have a global and international user interface that could be understood by all users worldwide who are from different countries with different cultures and languages. We propose a user interface consisting of smiley icons that are used to represent and build an international query language. Smiley icons enable the users to access data and build queries easily and in a user-friendly way. The visual query language, its user interface and its model are explained. The query formulation is illustrated using a sample GIS system for tourists. IVQL can be applied to fields such as Management Information Systems and tourism. We then conclude about our future work.

Assuming data domains are partially ordered, we apply Paredaens' and Bancilhon's Theorem to examine the expressiveness of the extended relational algebra (the PORA), which allows the ordering predicate to be used in formulae of the selection operator (σ). The PORA expresses exactly the set of all possible relations which are invariant under order-preserving automorphism of databases. Our main result shows that there is a one-toone correspondence between three hierarchies of: (1) computable queries, (2) query languages and (3) partially ordered domains.

A recent query-log mining approach for query recommendation is based on Query Flow Graphs, a markov-chain representation of the query reformulation process followed by users of Web Search Engines trying to satisfy their information needs. In this paper we aim at extending this model by providing methods for dealing with evolving data. In fact, users' interests change over time, and the knowledge extracted from query logs may suffer an aging effect as new interesting topics appear. Starting from this observation validated experimentally, we introduce a novel algorithm for updating an existing query flow graph. The proposed solution allows the recommendation model to be kept always updated without reconstructing it from scratch every time, by incrementally merging efficiently the past and present data.

World Wide Web content continuously grows in size and importance. Furthermore, users ask Web search engines to satisfy increasingly disparate information needs. New techniques and tools are constantly developed aimed at assisting users in the interaction with the Web search engine. Query recommender systems suggesting interesting queries to users are an example of such tools. Most query recommendation techniques are based on the knowledge of the behaviors of past users of the search engine recorded in query logs. A recent query-log mining approach for query recommendation is based on Query Flow Graphs (QFG). In this paper we propose an evaluation of the effects of time on this query recommendation model. As users interests change over time, the knowledge extracted from query logs may suffer an aging effect as new interesting topics appear. In order to validate experimentally this hypothesis, we build different query flow graphs from the queries belonging to a large query log of a real-world search engine. Each query flow graph is built on distinct query log segments. Then, we generate recommendations on different sets of queries. Results are assessed both by means of human judgments and by using an automatic evaluator showing that the models inexorably age.

This paper represents the concept of keys and relational algebra in database management system. Basically key is an attribute that is able to identify the records in given relation uniquely. Relational algebra is procedural query language. It takes instance of relations as an input and gives the desired output in form of relation. For evaluating desired output there may be several queries in relational algebra but based on record comparisons and block retrievals efficiency of query is calculated and after identifying efficient query, that query is applied to find out the desired set of records in relational algebra.

The tree-based languages XQuery and XSLT for XML are widely supported. Many tools do not yet support the new RDF graph query language SPARQL. We propose to embed SPARQL subqueries into XQuery/XSLT, such that XQuery and XSLT benefit from the graph query language constructs of SPARQL, and SPARQL benefits from features of XQuery/XSLT, which SPARQL does not support. The embedding enables XQuery/XSLT tools to handle at the same time XML queries and SPARQL subqueries, and XML and RDF data.

We establish a rigorous foundation for Relational Syntax Theory (RST), a novel mathematical framework for discrete physics based on purely syntactic principles. Central to RST is the Non-Duplication Theorem, which states that any derivable expression contains at most one occurrence of a distinguished symbol ⋆. We provide a complete mathematical formalization of derivable expressions over an admissible alphabet equipped with concatenation and enclosure operators. The proof of the Non-Duplication Theorem proceeds by structural induction and is verified using the Coq proof assistant. Our main contributions include: (1) a formal definition of derivability with explicit constraints on symbol occurrence, (2) an algorithmic Boolean parser proven equivalent to the inductive definition, (3) a rigorous proof of the Non-Duplication Theorem, and (4) the construction of a syntactic topology with a boundary operator satisfying ∂ 2 = NIL. This establishes RST as a well-defined mathematical structure suitable for discrete formulations of physical theories. The framework's consistency is demonstrated through machineverified proofs, and its falsifiability is established through an explicit criterion based on the Non-Duplication Theorem. These results provide a foundation for developing discrete analogues of conservation * Independent Researcher-Paris 1 laws and symmetries without requiring pre-existing notions of space, time, or continuous parameters.

Storage Area Networks (SANs) connect groups of storage devices to servers over fast interconnects. An important challenge lies in managing the complexity of the resulting massive SAN configurations. Policy-based validation using new logical frameworks has been proposed earlier as a solution to this configuration problem. SANchk offers a new solution that uses standard technologies such as SQL, XML, and Java, to implement a rule-based configuration checker. SANchk works as a lightweight extension to the relational databases of storage management systems; current support includes IBM's TPC and the open source Aperi storage manager. Some five dozen best practices rules for SAN configuration are implemented in SANchk, many of them with configurable parameters. Empirical results with several commercial SANs show that the approach is viable in practice.

Formulating a query on a Linked Open Data (LOD) source is not an easy task; a technical knowledge of the query language, and, the awareness of the structure of the dataset are essential to create a query. We present a revised version of LODeX that provides the user an easy way for building queries in a fast and interactive manner. When a user decides to explore a LOD source, he/she can take advantage of the Schema Summary produced by LODeX (i.e. a synthetic view of the dataset's structure) and he/she can pick graphical elements from it to create a visual query. The tool also supports the user in browsing the results and, eventually, in refining the query. The prototype has been evaluated on hundreds of public SPARQL endpoints (listed in Data Hub 1 ) and it is available online at . A survey conducted on 27 users has demonstrated that our tool can effectively support both unskilled and skilled users in exploring and querying LOD datasets.

In a scenario with “traditional” and “multimedia” data sources, this position paper discusses the following question: “How can a multimedia local source (e.g., Windsurf) supporting ranking queries be integrated into a mediator system without such capabilities (e.g., MOMIS)?” More precisely, “How to support ranking queries coming from a multimedia local source within a mediator system with a “traditional” query processor based on an SQL-engine?” We first describe a naive approach for the execution of range and Top-K global queries where the MOMIS query processing method remains substantially unchanged, but, in the case of Top-K queries, it does not guarantee to obtain K results. We then discuss two alternative modalities for allowing MOMIS to return the Top-K best results of a global query.

Search engine logs store detailed information on Web users interactions. Thus, as more and more people use search engines on a daily basis, important trails of users common knowledge are being recorded in those files. Previous research has shown that it is possible to extract concept taxonomies from full text documents, while other scholars have proposed methods to obtain similar queries from query logs. We propose a mixture of both lines of research, that is, mining query logs not to find related queries nor query hierarchies, but actual term taxonomies that could be used to improve search engine effectiveness and efficiency. As a result, in this study we have developed a method that combines lexical heuristics with a supervised classification model to successfully extract hyponymy relations from specialization search patterns revealed from log missions, with no additional sources of information, and in a language independent way.

Work on knowledge graphs and graph-based data management often focus either on declarative graph query languages or on frameworks for graph analytics, where there has been little work in trying to combine both approaches. However, many real-world tasks conceptually involve combinations of these approaches: a graph query can be used to select the appropriate data, which is then enriched with analytics, and then possibly filtered or combined again with other data by means of a query language. In this paper we propose a declarative language that is well suited to perform graph querying and analytical tasks. We do this by proposing a minimalistic extension of SPARQL to allow for expressing analytical tasks; in particular, we propose to extend SPARQL with recursive features, and provide a formal syntax and semantics for our language. We show that this language can express key analytical tasks on graphs (in fact, it is Turing complete), offering a more declarative alternative to existing ...

Works on knowledge graphs and graph-based data management often focus either on graph query languages or on frameworks for graph analytics, where there has been little work in trying to combine both approaches. However, many real-world tasks conceptually involve combinations of these approaches: a graph query can be used to select the appropriate data, which is then enriched with analytics, and then possibly filtered or combined again with other data by means of a query language. In this paper we propose a language that is well-suited for both graph querying and analytical tasks. We propose a minimalistic extension of SPARQL to allow for expressing analytical tasks over existing SPARQL infrastructure; in particular, we propose to extend SPARQL with recursive features, and provide a formal syntax and semantics for our language. We show that this language can express key analytical tasks on graphs (in fact, it is Turing complete). Moreover, queries in this language can also be compiled into sequences of iterations of SPARQL update statements. We show how procedures in our language can be implemented over off-the-shelf SPARQL engines, with a specialised client that can leverage database operations to improve the performance of queries. Results for our implementation show that procedures for popular analytics currently run in seconds or minutes for selective sub-graphs (our target use-case).

Navigational queries over RDF data are viewed as one of the main applications of graph query languages, and yet the standard model of graph databases—essentially labeled graphs—is different from the triples-based model of RDF. While encodings of RDF databases into graph data exist, we show that even the most natural ones are bound to lose some functionality when used in conjunction with graph query languages. The solution is to work directly with triples, but then many properties taken for granted in the graph database context (e.g., reachability) lose their natural meaning. Our goal is to introduce languages that work directly over triples and are closed, i.e., they produce sets of triples, rather than graphs. Our basic language is called TriAL, or Triple Algebra: it guarantees closure properties by replacing the product with a family of join operations. We extend TriAL with recursion and explain why such an extension is more intricate for triples than for graphs. We present a decl...

Dagstuhl seminar 10381 on robust query processing (held 19.09.10 -24.09.10) brought together a diverse set of researchers and practitioners with a broad range of expertise for the purpose of fostering discussion and collaboration regarding causes, opportunities, and solutions for achieving robust query processing. The seminar strove to build a unified view across the loosely-coupled system components responsible for the various stages of database query processing. Participants were chosen for their experience with database query processing and, where possible, their prior work in academic research or in product development towards robustness in database query processing. In order to pave the way to motivate, measure, and protect future advances in robust query processing, seminar 10381 focused on developing tests for measuring the robustness of query processing. In these proceedings, we first review the seminar topics, goals, and results, then present abstracts or notes of some of the seminar break-out sessions. We also include, as an appendix, the robust query processing reading list that was collected and distributed to participants before the seminar began, as well as summaries of a few of those papers that were contributed by some participants.

Functional completeness of a relational language is the ability to express linear recursive queries. We present such a language that also has the property of relational completeness (relational algebra is, in fact, embedded in it). The transitive closure of a binary relation is carried out by means of the projection function and its inverse.

XML/GML/SVG-based approaches are promising for building Web-based geographic information systems (WebGIS). However, current XML/GML/SVG-based WebGISs are lacking in spatial analysis. Some of them are designed for web mapping only. Others adopt a server-side solution for spatial analysis, which suffers from the 'bottleneck' problem and results in a high network transmission load. Load-balancing spatial analysis between server side and browser side can be used to solve the above problems. This article focuses on one of the key building blocks of load-balancing spatial analysis, that is, SVG-based spatial analysis which enables spatial querying and analysis directly on SVG (on the browser side). After analyzing the workflow of spatial analysis, we identify and focus on two key issues in providing spatial analysis on SVG: SVG-based spatial information representation and SVG-based spatial extended structured query language (SSESQL). For the first issue, a theoretical foundation is set up to develop an SVG-based spatial information representation model. Some spatial operators are designed and integrated into an SSESQL to support spatial querying on SVG. Finally, we design and implement two case studies. The results of these case studies show that the proposed method is feasible and operable in supporting spatial analysis directly on SVG on the browser side. The proposed method can be easily incorporated with some existing methods (e.g., GML-based spatial analysis on the server side) to provide load-balancing spatial analysis (load balancing between server side and browser side) in XML/GML/ SVG-based WebGIS. As a result, users can access high-performance spatial analysis simply via a web browser (such as Internet Explorer and Firefox).

In recent years, a number of database machines consisting of large numbers of parallel processing elements have been proposed. Unfortunately, there are two main limitations in database processing that prevent a high degree of parallelism; these are the available I/O bandwidth of the underlying storage devices and the concurrency control mechanisms necessary to guarantee data integrity. The main problem with conventional approaches is the lack of a computational model capable of utilizing the potential of any significant number of processing elements and storage devices and, at the same time, preserving the integrity of the database. This paper presents a database model and its associated architecture, which is based on the principles of data-driven computation. According to this model, the database is represented as a network in which each node is conceptually an independent, asynchronous processing element, capable of communicating with other nodes by exchanging messages along the ...

The amount of biological information accessible via the internet is growing at a tremendous rate. The biologists often encounter problems in accessing huge amount of widely spread data due to disparate formats, remotely dispersed and varying implementation on different platforms and data models. Besides that, the custom browsing and querying mechanism implemented in different data sources requires the users to uniquely query each individual database. Instead ofhaving different custom interfaces to these public bioinformat- ics databases, an intuitive common integrated data access method is proposed to provide uniform transparent access to disparate biological databases. The proposed mediator-based architecture consists of three conceptual layers namely Query Formulation, Query Transformation and Query Execution.

Obtaining correct and relevant information at the right time to user's query is quite a difficult task. This becomes even complex, if the query terms have many meanings and occur in different varieties of domain. This paper presents a fuzzy-ontology based information retrieval system that determine the semantic equivalence between terms in a query and terms in a document by relating the synonyms of query terms with those of document terms. Hence, documents could be retrieved based on the meaning of query terms. The challenge has been that surface form does not sufficiently retrieve relevant document to user's query. However, the results presented showed that the Fuzzy-Ontology Information Retrieval system successfully retrieve relevant documents to user's query. This is irrespective of different meaning and varieties of domain. The System was tested on words with different meanings and some set of user's query from varied domains.

SQL has been the result of years of query language research, and has many desirable properties. We i n troduce DSQL -a language that is based on a theoretical foundation of a declarative language document calculus and an equivalent procedural language document algebra. The outcome of this design is a language that looks and feels like SQL, yet is powerful enough to perform a vast range of queries on structured documents currently focused on XML. The design of the language is independent o f d o c u m e n t formats, so the capability of the language will not change if the underlying markup language were changed. In spite of its familiarity and simplicity, w e s h o w that this language has many desirable properties, and is a good candidate for a viable query language for XML. This paper presents a canonical form of DSQL, showing only the properties of the language that a ect the complexity of the language. Remarkably, SQL = core DSQL for at input and outputs.

Currently relational databases are widely used, while object-oriented databases are emerging as a new generation of database technology. This paper presents a methodology to provide effective sharing of information in object-oriented databases and relational databases. The object-oriented data model is selected as a common data model to build an integrated view of the diverse databases. An object-oriented query language is used as a standard query language. A method is developed to transform a relational data definition to an equivalent object-oriented data definition and to integrate local data definitions. Two distributed query processing methods are derived. One is for general queries and the other for a special class of restricted queries. Using the methods developed, it is possible to access distributed object-oriented databases and relational databases such that the locations and the structural differences of the databases are transparent to users.

This paper structures a novel vision for OLAP by fundamentally redefining several of the pillars on which OLAP has been based for the last 20 years. We redefine OLAP queries, in order to move to higher degrees of abstraction from roll-up's and drill-down's, and we propose a set of novel intentional OLAP operators, namely, describe, assess, explain, predict, and suggest, which express the user's need for results. We fundamentally redefine what a query answer is, and escape from the constraint that the answer is a set of tuples; on the contrary, we complement the set of tuples with models (typically, but not exclusively, results of data mining algorithms over the involved data) that concisely represent the internal structure or correlations of the data. Due to the diverse nature of the involved models, we come up (for the first time ever, to the best of our knowledge) with a unifying framework for them, that places its pillars on the extension of each data cell of a cube with information about the models that pertain to it -practically converting the small parts that build up the models to data that annotate each cell. We exploit this data-to-model mapping to provide highlights of the data, by isolating data and models that maximize the delivery of new information to the user. We introduce a novel method for assessing the surprise that a new query result brings to the user, with respect to the information contained in previous results the user has seen via a new interestingness measure. The individual parts of our proposal are integrated in a new data model for OLAP, which we call the Intentional Analytics Model. We complement our contribution with a list of significant open problems for the community to address.

In this work, we describe the set of tools comprising the Data Access Infrastructure within Advancing Clinico-genomic Trials on Cancer (ACGT), a R&D Project funded in part by the European. This infrastructure aims at improving Post-genomic clinical trials by providing seamless access to integrated clinical, genetic, and image databases. A data access layer, based on OGSA-DAI, has been developed in order to cope with syntactic heterogeneities in databases. The semantic problems present in data sources with different nature are tackled by two core tools, namely the Semantic Mediator and the Master Ontology on Cancer. The ontology is used as a common framework for semantics, modelling the domain and acting as giving support to homogenization. SPARQL has been selected as query language for the Data Access Services and the Mediator. Two experiments have been carried out in order to test the suitability of the selected approach, integrating clinical and DICOM image databases.

Semantic web is an emerging area to augment human reasoning. Various technologies are being developed in this arena which have been standardized by the World Wide Web Consortium (W3C). One such standard is the Resource Description Framework (RDF). Semantic web technologies can be utilized to build efficient and scalable systems for Cloud Computing. With the explosion of semantic web technologies, large RDF graphs are common place. This poses significant challenges for the storage and retrieval of RDF graphs. Current frameworks do not scale for large RDF graphs and as a result do not address these challenges. In this paper, we describe a framework that we built using Hadoop to store and retrieve large numbers of RDF triples by exploiting the cloud computing paradigm. We describe a scheme to store RDF data in Hadoop Distributed File System. More than one Hadoop job (the smallest unit of execution in Hadoop) may be needed to answer a query because a single triple pattern in a query cannot simultaneously take part in more than one join in a single Hadoop job. To determine the jobs, we present an algorithm to generate query plan, whose worst case cost is bounded, based on a greedy approach to answer a SPARQL Protocol and RDF Query Language (SPARQL) query. We use Hadoop's MapReduce framework to answer the queries. Our results show that we can store large RDF graphs in Hadoop clusters built with cheap commodity class hardware. Furthermore, we show that our framework is scalable and efficient and can handle large amounts of RDF data, unlike traditional approaches.

Communicable diseases pose significant threats at local, regional, and global levels, often leading to epidemics or pandemics. An epidemic refers to a sudden increase in the number of cases of an infectious disease above what is normally expected in a given population. Examples include cholera, measles, malaria, and dengue fever. Pandemics, however, can result in widespread illness, significant loss of life, and severe social and economic consequences. Concerns about potential pandemic diseases, such as new strains of influenza and severe acute respiratory syndrome (SARS) remain critical. This study presents a deep learning framework based on Geographic Information Systems (GIS) to predict the spatial distribution of epidemic infectious diseases. The framework combines the strengths of deep learning and GIS techniques, both of which offer exceptional capabilities in the field of epidemiology. The study outlines the key steps involved in developing the proposed framework and explains its operational functionality. The proposed framework aims to enhance decision-making efficiency, assist governmental authorities in generating sustainable strategies, and establish appropriate protocols to control epidemics, particularly in highrisk areas. By predicting vulnerable areas, the framework helps mitigate the risks associated with outbreaks and protects social and economic stability. Choosing an appropriate framework requires consideration of several key factors, including those relevant to the spread of diseases or epidemics, accuracy, flexibility, and validation.

Current browsers for object-oriented languages su er from restricted query capabilities that only allow for class-oriented views on the classsystem. As a result, browsers are very poor in providing support for software engineering techniques that go beyond single classes, like frameworks, contracts and design patterns. This paper proposes the combination of a logical query language and user interface components as a foundation for non class-oriented, customizable browsers able to support recent and future object-oriented software engineering techniques. Validation of this proposal is done by building browsers for di erent domains in Smalltalk.

Current browsers for object-oriented languages su er from restricted query capabilities that only allow for class-oriented views on the classsystem. As a result, browsers are very poor in providing support for software engineering techniques that go beyond single classes, like frameworks, contracts and design patterns. This paper proposes the combination of a logical query language and user interface components as a foundation for non class-oriented, customizable browsers able to support recent and future object-oriented software engineering techniques. Validation of this proposal is done by building browsers for di erent domains in Smalltalk.

Cross-Language Information Retrieval (CLIR) is responsible for retrieving information stored in a language different from the language of the query provided by the user. Some translation methods commonly used in CLIR are Dictionary, Parallel corpora, Comparable corpora, Machine translator, Ontology, and Transitive-based. The query must be translated to the target language, followed by preprocessing and calculating the similarity between the query and all documents in the corpus. The problem is the time and accuracy of query translation. Moreover, the queries are not written as complete sentences according to certain language rules. Stemming, for example, every language has its own method. Indonesian has basic words and affixes in the form of prefixes, suffixes, infixes, and confixes, while English only has suffixes. Stemming takes a long time in text processing. In the Indonesian search engine (SEBI), the provision of cross-language tourism news retrieval is realized using the Googl...

In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textual markup (ie POS tagging, syntax, pragmatics) including a toolkit used to perform ...

Le temps qui change les êtres, ne modi e en rien l'image que nous avons gard ee d'eux Marcel Proust Le temps retrouv e. Je voudrais cette page a la fois : Sinc ere comme les remerciements que j'exprime a ceux qui ont contribu ea ud eroulemente t a l'ach evement de cette th ese. A Marie-Christine Fauvet et Pierre-Claude Scholl, qui ont guid e et soutenu mes initiatives depuis de nombreuses ann ees. Plus que des directeurs de th ese, ils ont souvent et e des mentors et des amis. A Michel Adiba qui a suivi avec attention mes premiers pas dans la recherche. Je le remercie au passage d'avoir accept edepr esider le jury de cette th ese. A Sophie Cluet qui a lu dans ce document non seulement les mots, les points et les virgules, mais aussi des id ees si cach ees et subtiles que j'ai du mal a comprendre comment elles ont pu se fau ler entre ces pages. A Christian S. Jensen, qui m'a fait un tr es grand honneur en acceptant de rapporter cette th ese. Ses commentaires et critiques constructives m'ont apport e un regard eclairant sur les contributions et les erreurs de mes recherches. Thanks to Christian S. Jensen who honoredmebyreviewing this thesis. His comments and constructive criticisms provided me with a valuable viewpoint into my research's mistakes and contributions. A Jacques Le Matre pour l'int erêt qu'il a montr eenvers mes recherches et pour avoir accept ede participer au jury de cette th ese. A Michel Scholl, aux conseils en or. A tous ceux avec qui j'ai eu le plaisir de collaborer :

Traditional data mining technologies cannot work with huge, heterogeneous, unstructured data. Modern web database as well as scientific database maintains tremendous and heterogeneous data. These real word databases may contain hundreds or even thousands of relations and attributes. Query form is one of the most widely used interfaces for querying database. Traditional query forms are designed and pre-defined by developer or DBA in various information management systems. But extracting the useful information with this traditional query form from large dataset and streams of the data is not possible and it is difficult to design set of static query forms to satisfy numerous ad- hoc database queries on those complex databases. In this paper, we propose a Search optimization using dynamic query form system SODQF. SODQF is a query interface which is able to dynamically generating query forms for user. Unlike to tradition document retrieval, users in database retrieval are often willing ...

Many approaches have been used for querying spatial databases, but they rarely distinguish between expert users and "naive" ones. Two main approaches can be considered as interesting ways of querying and interacting with spatial and multimedia data, extended query languages on the one hand, and hypermedia techniques on the other hand. In this paper, we propose a framework for a navigational user interface model that will use both hypermedia and query language approaches. Navigation methods will use two types of links, explicit hypermedia links on the one hand, implicit and dynamic ones on the other hand which are based on spatial relationships between entities. We also propose different kinds of navigation strategies that will be usable and hopefully accepted by general public-like users.

Ontology-mediated querying (OMQ) provides a paradigm for query answering according to which users not only query records at the database but also query implicit information inferred from ontology. A key challenge in OMQ is that the implicit information may be infinite, which cannot be stored at the database and queried by off -the -shelf query engine. The commonly adopted technique to deal with infinite entailments is query rewriting, which, however, comes at the cost of query rewriting at runtime. In this work, the partial materialization method is proposed to ensure that the extension is always finite. The partial materialization technology does not rewrite query but instead computes partial consequences entailed by ontology before the online query. Besides, a query analysis algorithm is designed to ensure the completeness of querying rooted and Boolean conjunctive queries over partial materialization. We also soundly and incompletely expand our method to support highly expressive...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Database systems methodologies and technology can provide a significant support to data mining processes. In this chapter we explore approaches which address the integration between data mining activities and DBMSs from different perspectives. More specifically, we focus on (i) specialized query languages which allow to define complex data mining tasks through the submission of query requests, and (ii) indices, i.e., physical data structures designed to improve the performance of mining algorithms.