73,337 research outputs found

    The relational geometry of the port-city interface : case studies of Amsterdam, the Netherlands, and Ghent, Belgium

    No full text
    The aim of this paper is to operationalize a relational approach to the study of port-city interfaces. A relational approach allows for the analysis of how actors are connected, transact, and assign meaning and value to regional development. Much of the literature on port-city interfaces has primarily focussed on late 20th century transformation processes at the urban waterfront. This fails to appreciate the often-continued presence of port activity within cities and falls short in understanding how the development agendas of port cities are relationally constituted. In this paper, first we argue that the port-city interface is a relational geometry through which heterogeneous flows of actors, assets, and structures are coupled. Second, we present an analytical framework capable of operationalizing such relational approach. The contemporary relational geometries in the bio-based sectors within the port cities of Amsterdam and Ghent are taken as starting points. Analysing these reveal how different coupling mechanisms result in particular development trajectories of the port city, setting the scene for future coupling mechanisms. This paper concludes with a discussion on the value of a relational approach to the study of port-city interfaces

    Algebraic optimization of recursive queries

    Get PDF
    Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. However, they do not offer appropriate update facilities, and do not support existing applications. To overcome these problems an SQL-like interface is required besides a logic-based interface.\ud \ud In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAlog. Query optimization is localized in one component: the relational query optimizer. Therefore, we have defined an eXtended Relational Algebra that allows recursive query formulation and can also be used for expressing executable schedules, and we have developed algebraic optimization strategies for recursive queries. In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations. We also describe how to push selections into the resulting transitive closure operations.\ud \ud The reason we focus on algebraic optimization is that, in our opinion, the new generation of advanced database systems will be built starting from existing state-of-the-art relational technology, instead of building a completely new class of systems

    Tuning the Interface for Relational Listening

    Full text link
    Abstract: This paper re-visits my creative and research experiences with the creation of sound-driven interfaces for navigation and performance, as part of a personal quest for space and identity. Involving geographical migration, its sonic experience and the connections mediated with internet technologies, the experience of listening and performing within dislocation refers not only to the development of technological systems, but also to the exploration of new forms of interacting with the self and others through listening and sounding in distant locations, inviting participants to the discovery of ‘in-between’ sonic spaces for being. Derived from the need for a shared conceptual and technical framework, the project ‘Sound Matters Framework’ has explored, with other sound artists and researchers, practices of interrogation and relational playback for the creative interplay of field recordings and speech. The framework has evolved into the idea of creating interfaces for relational listening. What characteristics might be involved in such imagined interfaces and what relational listening means within contemporary contexts of dislocation, are the questions that I am formulating on this paper within the broader field of live interfaces

    Database search vs. information retrieval : a novel method for studying natural language querying of semi-structured data

    Get PDF
    The traditional approach of querying a relational database is via a formal language, namely SQL. Recent developments in the design of natural language interfaces to databases show promising results for querying either with keywords or with full natural language queries and thus render relational databases more accessible to non-tech savvy users. Such enhanced relational databases basically use a search paradigm which is commonly used in the field of information retrieval. However, the way systems are evaluated in the database and the information retrieval communities often differs due to a lack of common benchmarks. In this paper, we provide an adapted benchmark data set that is based on a test collection originally used to evaluate information retrieval systems. The data set contains 45 information needs developed on the Internet Movie Database (IMDb), including corresponding relevance assessments. By mapping this benchmark data set to a relational database schema, we enable a novel way of directly comparing database search techniques with information retrieval. To demonstrate the feasibility of our approach, we present an experimental evaluation that compares SODA, a keyword-enabled relational database system, against the Terrier information retrieval system and thus lays the foundation for a future discussion of evaluating database systems that support natural language interfaces

    A Brief Study of Open Source Graph Databases

    Full text link
    With the proliferation of large irregular sparse relational datasets, new storage and analysis platforms have arisen to fill gaps in performance and capability left by conventional approaches built on traditional database technologies and query languages. Many of these platforms apply graph structures and analysis techniques to enable users to ingest, update, query and compute on the topological structure of these relationships represented as set(s) of edges between set(s) of vertices. To store and process Facebook-scale datasets, they must be able to support data sources with billions of edges, update rates of millions of updates per second, and complex analysis kernels. These platforms must provide intuitive interfaces that enable graph experts and novice programmers to write implementations of common graph algorithms. In this paper, we explore a variety of graph analysis and storage platforms. We compare their capabil- ities, interfaces, and performance by implementing and computing a set of real-world graph algorithms on synthetic graphs with up to 256 million edges. In the spirit of full disclosure, several authors are affiliated with the development of STINGER.Comment: WSSSPE13, 4 Pages, 18 Pages with Appendix, 25 figure

    CREOLE: a Universal Language for Creating, Requesting, Updating and Deleting Resources

    Get PDF
    In the context of Service-Oriented Computing, applications can be developed following the REST (Representation State Transfer) architectural style. This style corresponds to a resource-oriented model, where resources are manipulated via CRUD (Create, Request, Update, Delete) interfaces. The diversity of CRUD languages due to the absence of a standard leads to composition problems related to adaptation, integration and coordination of services. To overcome these problems, we propose a pivot architecture built around a universal language to manipulate resources, called CREOLE, a CRUD Language for Resource Edition. In this architecture, scripts written in existing CRUD languages, like SQL, are compiled into Creole and then executed over different CRUD interfaces. After stating the requirements for a universal language for manipulating resources, we formally describe the language and informally motivate its definition with respect to the requirements. We then concretely show how the architecture solves adaptation, integration and coordination problems in the case of photo management in Flickr and Picasa, two well-known service-oriented applications. Finally, we propose a roadmap for future work.Comment: In Proceedings FOCLASA 2010, arXiv:1007.499

    Optimally Storing the User Interaction in Mashup Interfaces within a Relational Database

    Get PDF
    Cross-device applications that have user interfaces managed in multiple forms of interaction are prevalent. In particular, component-based (or mashup) applications are growing in popularity due to their easiness to build customized user interfaces with pieces of information from different sources. Since the user interaction on mashup interfaces can generate a large quantity of data, which can be useful to improving the interaction and usefulness of the application, it may involve the creation of cloud infrastructures to manage the dynamic distributed user interfaces within this context. Storing the generated data from the interaction performed over the user interface can be challenging. To achieve these goals, in this paper, a relational database for storing this interaction information generated on distributed user interfaces is proposed. Thus, user interaction over heterogeneous interfaces and devices described in detail, will be easily accessible for further analysis using machine learning and data mining techniques to offer a better user experience
    corecore