Filters








20 Hits in 0.82 sec

SODA

Lukas Blunschi, Claudio Jossen, Donald Kossmann, Magdalini Mori, Kurt Stockinger
2012 Proceedings of the VLDB Endowment  
The purpose of data warehouses is to enable business analysts to make better decisions. Over the years the technology has matured and data warehouses have become extremely successful. As a consequence, more and more data has been added to the data warehouses and their schemas have become increasingly complex. These systems still work great in order to generate pre-canned reports. However, with their current complexity, they tend to be a poor match for non tech-savvy business analysts who need
more » ... swers to ad-hoc queries that were not anticipated. This paper describes the design, implementation, and experience of the SODA system (Search over DAta Warehouse). SODA bridges the gap between the business needs of analysts and the technical complexity of current data warehouses. SODA enables a Google-like search experience for data warehouses by taking keyword queries of business users and automatically generating executable SQL. The key idea is to use a graph pattern matching algorithm that uses the metadata model of the data warehouse. Our results with real data from a global player in the financial services industry show that SODA produces queries with high precision and recall, and makes it much easier for business users to interactively explore highly-complex data warehouses.
doi:10.14778/2336664.2336667 fatcat:4qjqmhctubbmfmg4mkdfxkfi2e

SODA: Generating SQL for Business Users [article]

Lukas Blunschi, Claudio Jossen, Donald Kossman, Magdalini Mori, Kurt Stockinger
2012 arXiv   pre-print
The purpose of data warehouses is to enable business analysts to make better decisions. Over the years the technology has matured and data warehouses have become extremely successful. As a consequence, more and more data has been added to the data warehouses and their schemas have become increasingly complex. These systems still work great in order to generate pre-canned reports. However, with their current complexity, they tend to be a poor match for non tech-savvy business analysts who need
more » ... swers to ad-hoc queries that were not anticipated. This paper describes the design, implementation, and experience of the SODA system (Search over DAta Warehouse). SODA bridges the gap between the business needs of analysts and the technical complexity of current data warehouses. SODA enables a Google-like search experience for data warehouses by taking keyword queries of business users and automatically generating executable SQL. The key idea is to use a graph pattern matching algorithm that uses the metadata model of the data warehouse. Our results with real data from a global player in the financial services industry show that SODA produces queries with high precision and recall, and makes it much easier for business users to interactively explore highly-complex data warehouses.
arXiv:1207.0134v1 fatcat:n6rvykhg4nfxpoqcs73wjcqrne

Dwarfs in the rearview mirror

Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz Salles
2008 Proceedings of the VLDB Endowment  
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick response times on any Terabyte-sized business data problem. Recently, a very clever multi-dimensional index structure termed Dwarf [26] has been proposed offering excellent query response times as well as unmatched index compression rates. The proposed index seems to scale well for both large data sets as well as high
more » ... ns. Motivated by these surprisingly excellent results, we take a look into the rearview mirror. We have re-implemented the Dwarf index from scratch and make three contributions. First, we successfully repeat several of the experiments of the original paper. Second, we substantially correct some of the experimental results reported by the inventors. Some of our results differ by orders of magnitude. To better understand these differences, we provide additional experiments that better explain the behavior of the Dwarf index. Third, we provide missing experiments comparing Dwarf to baseline query processing strategies. This should give practitioners a better guideline to understand for which cases Dwarf indexes could be useful in practice.
doi:10.14778/1454159.1454230 fatcat:lv4qq6ko3bbrhjvrh3cvavc5zi

Intensional associations in dataspaces

Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Blunschi
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associations among them may emerge as a consequence of different criteria, such as their city of origin or their elected hobbies. In this paper, we advocate a declarative approach to specifying these associations. We propose that each set of associations be defined by an association trail. An association trail is a
more » ... d definition of how items are connected by intensional (i.e., virtual) association edges to other items in the dataspace. We study the problem of processing neighborhood queries over such intensional association graphs. The naive approach to neighborhood query processing over intensional graphs is to materialize the whole graph and then apply previous work on dataspace graph indexing to answer queries. We present in this paper a novel indexing technique, the grouping-compressed index (GCI), that has better worst-case indexing cost than the naive approach. In our experiments, GCI is shown to provide an order of magnitude gain in indexing cost over the naive approach, while remaining competitive in query processing time.
doi:10.1109/icde.2010.5447833 dblp:conf/icde/SallesDB10 fatcat:wiqf3p2f2zbovegtq2y65gla5a

Indexing Moving Objects Using Short-Lived Throwaway Indexes [chapter]

Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz Salles
2009 Lecture Notes in Computer Science  
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive data sets. To meet the high update rate as well as low query response time requirements of moving object applications, this paper takes a novel approach in moving object indexing. In our approach we do not require a sophisticated index structure that needs to be adjusted for each incoming update. Rather we construct
more » ... nceptually simple short-lived throwaway indexes which we only keep for a very short period of time (sub-seconds) in main memory. As a consequence, the resulting technique MOVIES supports at the same time high query rates and high update rates and trades this for query result staleness. Moreover, MOVIES is the first main memory method supporting time-parameterized predictive queries. To support this feature we present two algorithms: non-predictive MOVIES and predictive MOVIES. We obtain the surprising result that a predictive indexing approach -considered state-of-the-art in an external-memory scenario -does not scale well in a main memory environment. In fact our results show that MOVIES outperforms state-of-the-art moving object indexes like a main-memory adapted B x -tree by orders of magnitude w.r.t. update rates and query rates. Finally, our experimental evaluation uses a workload unmatched by any previous work. We index the complete road network of Germany consisting of 40,000,000 road segments and 38,000,000 nodes. We scale our workload up to 100,000,000 moving objects, 58,000,000 updates per second and 10,000 queries per second which is unmatched by any previous work.
doi:10.1007/978-3-642-02982-0_14 fatcat:pmmx7d3b35eshbftpuh66p23qi

Data-thirsty business analysts need SODA

Lukas Blunschi, Claudio Jossen, Donald Kossmann, Magdalini Mori, Kurt Stockinger
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
Querying large data warehouses is very hard for non-tech savvy business users. Deep technical knowledge of both SQL as well as the schema of the database is required in order to build correct queries and to come up with new business insights. In this paper we introduce a novel system called SODA (Search Over DAta Warehouse) that bridges the gap between the business world and the IT world by enabling extended keyword search in a data warehouse. SODA uses metadata information, DBpedia entries as
more » ... ell as base data to generate SQL to allow intuitive exploration of the data. The process of query classification, query graph generation and SQL generation is visualized to provide the analysts with information on how the query results are produced. Experiments with real data of a global financial institution comprising around 300 tables showed promising results.
doi:10.1145/2063576.2064009 dblp:conf/cikm/BlunschiJKMS11 fatcat:c5xkbz5gd5eorf47wsknrszc54

Sox10 promotes the formation and maintenance of giant congenital naevi and melanoma

Olga Shakhova, Daniel Zingg, Simon M. Schaefer, Lisette Hari, Gianluca Civenni, Jacqueline Blunschi, Stéphanie Claudinot, Michal Okoniewski, Friedrich Beermann, Daniela Mihic-Probst, Holger Moch, Michael Wegner (+4 others)
2012 Nature Cell Biology  
Giant congenital naevi are pigmented childhood lesions that frequently lead to melanoma, the most aggressive skin cancer. The mechanisms underlying this malignancy are largely unknown, and there are no effective therapies. Here we describe a mouse model for giant congenital naevi and show that naevi and melanoma prominently express Sox10, a transcription factor crucial for the formation of melanocytes from the neural crest. Strikingly, Sox10 haploinsufficiency counteracts Nras(Q61K)-driven
more » ... nital naevus and melanoma formation without affecting the physiological functions of neural crest derivatives in the skin. Moreover, Sox10 is also crucial for the maintenance of neoplastic cells in vivo. In human patients, virtually all congenital naevi and melanomas are SOX10 positive. Furthermore, SOX10 silencing in human melanoma cells suppresses neural crest stem cell properties, counteracts proliferation and cell survival, and completely abolishes in vivo tumour formation. Thus, SOX10 represents a promising target for the treatment of congenital naevi and melanoma in human patients.
doi:10.1038/ncb2535 pmid:22772081 fatcat:65b2bphqyrcn5godlqfetwbxsm

Cost-based query optimization in iMeMex

Lukas Blunschi
2007
Personal Information Management (PIM) refers to managing all data related to a single individual. In more detail, PIM is: integrating highly heterogeneous data sources, runtime environments which may change dramatically, a query language which is powerful, but still simple to use, semantic integration of all data pertaining to a user, sharing parts of my data with friends, query processing in such a system. PIM is becoming more and more important, but still there is no single system available
more » ... ich is able to handle all challenges. iMeMex [15] is among the first systems aiming to support all of that functionality. In this thesis we enrich iMeMex so that it can adapt to adding or removing data sources and index structures and look at how to process and optimize queries in iMeMex. To solve the former we use OSGi as the basic runtime platform and separate our system into basic building blocks, aka bundles. By doing so not only functionality to access different data sources, but also all indexes, materialized views and replicas become hot-pluggable. As an effect our query processor does not have to be changed when new system functionality is added or removed. To work on the latter we introduce a query processing model that is completely based on query pushdown. Here we profit from having an adaptable system architecture enabling us to treat data sources, indexes and materialized views as low-level query planners. Each of these query planners may decide by itself how much of a query plan it wants to handle and also what cost model it uses. We show how the returned physiological plans can be used in extensible cost-based query optimization. To show the feasability of these techniques, several use cases are studied in detail.
doi:10.3929/ethz-a-005729133 fatcat:luhlg4r7dfawljbbuqfvcodjki

Special section on spatial and temporal databases

Nikos Mamoulis, Thomas Seidl
2011 Geoinformatica  
The paper MOVIES: Indexing Moving Objects by Shooting Index Images, by Jens Dittrich, Lukas Blunschi, and Marcos Vaz Salles, extends "Indexing Moving Objects using Short-Lived Throwaway Indexes."  ... 
doi:10.1007/s10707-011-0139-2 fatcat:vfsripwibvfbffrvni7yfgf244

Die Goldschmiede-Dynastie Bossard in Zug und Luzern, ihre Mitglieder und Merkzeichen

Edmund Bossard
1956
Der Lukas-Bruderschaft scheint er nicht angehört zu haben.  ...  Der Lukas-Bruderschaft scheint er nicht angehört zu haben.  ... 
doi:10.5169/seals-118465 fatcat:xbbyannnrzfblmzidr6hsw4zj4

Die vierte Gewalt : Dieter Fahrer

Tereza Fischer
2018
Lukas Foerster -> Regie: Rahul Jain; Kamera: Rodrigo Trejo Villanueva; Schnitt: Yael Bitton, Robert Fenz, Rahul Jain. Produktion: Jann Pictures, Pallas Film, IV Film.  ...  Mit: Patrick Feuz, Marc Lettau, Judith Huber, Samuel Wyss, Peter Blunschi, Rafaela Roth, Madeleine Sigrist, Christof Moser, Constantin Seibt. Produktion: Balzli 8t Fahrer Filmproduktion, SRF.  ... 
doi:10.5169/seals-862898 fatcat:xehqkerbb5gtrh4oe5vnsbtloe

Bio-SODA: Enabling Natural Language Question Answering over Knowledge Graphs without Training Data [article]

Ana Claudia Sima, Tarcisio Mendes de Farias, Maria Anisimova, Christophe Dessimoz, Marc Robinson-Rechavi, Erich Zbinden, Kurt Stockinger
2021 arXiv   pre-print
ACKNOWLEDGMENTS We thank the Swiss National Science Foundation for funding (NRP 75, grant 407540_167149), Lukas Blunschi for the implementation of the SODA system for keyword search system over relational  ... 
arXiv:2104.13744v4 fatcat:swbggfd34ng7fgh7qaiqokvxa4

Die Katakombenheiligen der Schweiz in ihren bildlichen Darstellungen

P. Rudolf Henggeler
1939
Aloys Blunschi in Zug 1825 gedruckten Gebetszettel, der den Titel trägt: An/ dächtiges Gebeth, zu dem heiligen Martyrer Leontius im Gotteshause Mury. Größe 20,1x24,5 cm.  ...  Lukas Fuchs und Dr. P. Bruno Wilhelm in Sarnen, Dr. P. Alban Stöckli in Stans, Br. Otmar Benz in Schwyz, sowie den Vorständen der genannten Bibliotheken. Alpnach (Kt. Obwalden). Lithographie.  ... 
doi:10.5169/seals-162417 fatcat:zsyqq2pubvhlbdkjq7zr25argu

A Methodology for Creating Question Answering Corpora Using Inverse Data Annotation

Jan Deriu, Katsiaryna Mlynchyk, Philippe Schläpfer, Alvaro Rodrigo, Dirk von Grünigen, Nicolas Kaiser, Kurt Stockinger, Eneko Agirre, Mark Cieliebak
2020 Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics   unpublished
Lukas Blunschi, Claudio Jossen, Donald Kossmann, Magdalini Mori, and Kurt Stockinger. 2012. Soda: Generating sql for business users. Proceedings of the VLDB Endowment, 5(10):932-943.  ...  ., 2008; Blunschi et al., 2012; Bast and Haussmann, 2015) . Pattern-based approaches are able to handle more complex NL questions (Damljanovic et al., 2010; Zheng et al., 2017) .  ... 
doi:10.18653/v1/2020.acl-main.84 fatcat:buzw344be5epfbvotjwvvpjyxe

Bio-SODA : enabling natural language question answering over knowledge graphs without training data

Ana Claudia Sima, Tarcisio Mendes De Farias, Maria Anisimova, Christophe Dessimoz, Marc Robinson-Rechavi, Erich Zbinden, Kurt Stockinger
2021
ACKNOWLEDGMENTS We thank the Swiss National Science Foundation for funding (NRP 75, grant 407540_167149), Lukas Blunschi for the implementation of the SODA system for keyword search system over relational  ... 
doi:10.21256/zhaw-22738 fatcat:2nqehlo6qbanhiunhoegnsni3e
« Previous Showing results 1 — 15 out of 20 results