An interactive SQL relational interface for querying main-memory data structures

被引:1
|
作者
Fragkoulis, Marios [1 ]
Spinellis, Diomidis [1 ]
Louridas, Panos [1 ]
机构
[1] Athens Univ Econ & Business, Dept Management Sci & Technol, Athens 10434, Greece
关键词
SQL; Interactive; Query; Main-memory; Object;
D O I
10.1007/s00607-015-0452-y
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Query formalisms and facilities have received significant attention in the past decades resulting in the development of query languages with varying characteristics; many of them resemble sql. Query facilities typically ship as part of database management systems or, sometimes, bundled with programming languages. For applications written in imperative programming languages, database management systems impose an expensive model transformation. In-memory data structures can represent sophisticated relationships in a manner that is efficient in terms of storage and processing overhead, but most general purpose programming languages lack an interpreter and/or an expressive query language for manipulating interactive queries. Issuing interactive ad-hoc queries on program data structures is tough. This work presents a method and an implementation for representing an application's arbitrary imperative programming data model as a queryable relational one. The Pico COllections Query Library (pico ql) uses a domain specific language to define a relational representation of application data structures and an sql interface implementation. Queries are issued interactively and are type safe. We demonstrate our relational representation for objects and the library's usefulness on three large c++ projects. pico ql enhances query expressiveness and boosts productivity compared to querying via traditional programming constructs.
引用
收藏
页码:1141 / 1164
页数:24
相关论文
共 37 条
  • [21] Querying large read collections in main memory: a versatile data structure
    Philippe, Nicolas
    Salson, Mikael
    Lecroq, Thierry
    Leonard, Martine
    Commes, Therese
    Rivals, Eric
    [J]. BMC BIOINFORMATICS, 2011, 12
  • [22] Querying large read collections in main memory: a versatile data structure
    Nicolas Philippe
    Mikaël Salson
    Thierry Lecroq
    Martine Léonard
    Thérèse Commes
    Eric Rivals
    [J]. BMC Bioinformatics, 12
  • [23] Querying Relational Event Graphs Using Colored Range Searching Data Structures
    Chanchary, Farah
    Maheshwari, Anil
    Smid, Michiel
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, 2017, 10156 : 83 - 95
  • [24] Querying relational event graphs using colored range searching data structures
    Chanchary, Farah
    Maheshwari, Anil
    Smid, Michiel
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 286 (286) : 51 - 61
  • [25] SEMANTICALLY RICH API FOR IN-DATABASE DATA MANIPULATION IN MAIN-MEMORY ERP SYSTEMS
    Borovskiy, Vadym
    Schwarz, Christian
    Zeier, Alexander
    Koch, Wolfgang
    [J]. ICEIS 2011: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, VOL 1, 2011, : 253 - 260
  • [26] VIREX: Interactive approach for database querying and integration by re-engineering relational data into XML
    Lo, Anthony
    Alhajj, Reda
    Barker, Ken
    [J]. 2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, (WI 2006 MAIN CONFERENCE PROCEEDINGS), 2006, : 1079 - +
  • [27] SAP HANA: The Evolution from a Modern Main-Memory Data Platform to an Enterprise Application Platform
    Sikka, Vishal
    Faerber, Franz
    Goel, Anil
    Lehner, Wolfgang
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (11): : 1184 - 1185
  • [28] Cost Effective Load-Balancing Approach for Range-Partitioned Main-Memory Resident Data
    Belayadi, Djahida
    Hidouci, Khaled-Walid
    Bellatreche, Ladjel
    Ordonez, Carlos
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS (DEXA 2018), PT II, 2018, 11030 : 239 - 249
  • [29] Robust Performance of Main Memory Data Structures by Configuration
    Bang, Tiemo
    Oukid, Ismail
    May, Norman
    Petrov, Ilia
    Binnig, Carsten
    [J]. SIGMOD'20: PROCEEDINGS OF THE 2020 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2020, : 1651 - 1666
  • [30] Access Path Selection in Main-Memory Optimized Data Systems: Should I Scan or Should I Probe?
    Kester, Michael S.
    Athanassoulis, Manos
    Idreos, Stratos
    [J]. SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, : 715 - 730