Filters








128,584 Hits in 9.8 sec

AutoAdmin "what-if" index analysis utility

Surajit Chaudhuri, Vivek Narasayya
1998 Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98  
We describe the interfaces exposed by this utility that can be leveraged by a variety of front-end tools and sketch important aspects of the user interfaces enabled by the utility.  ...  Furthermore, the DBA should have the ability to propose hypothetical ("what-if') indexes and quantitatively analyze their impact on performance of the system.  ...  queries on a hypothetical configuration are being optimized.  ... 
doi:10.1145/276304.276337 dblp:conf/sigmod/ChaudhuriN98 fatcat:n3aei5pwpnfmtb25ikee3du2fi

AutoAdmin "what-if" index analysis utility

Surajit Chaudhuri, Vivek Narasayya
1998 SIGMOD record  
We describe the interfaces exposed by this utility that can be leveraged by a variety of front-end tools and sketch important aspects of the user interfaces enabled by the utility.  ...  Furthermore, the DBA should have the ability to propose hypothetical ("what-if') indexes and quantitatively analyze their impact on performance of the system.  ...  queries on a hypothetical configuration are being optimized.  ... 
doi:10.1145/276305.276337 fatcat:pnydm7ufzffe5hyhghcap53gx4

Information synthesis in statistical databases

Wee-Keong Ng, Chinya V. Ravishankar
1995 Proceedings of the fourth international conference on Information and knowledge management - CIKM '95  
We also show that selecting the optimal set of summary tables from the database that yields the best solution to the query is NP-complete.  ...  In particular, we consider the case when the query cannot be directly satisfied via a single summary table and requires two or more summary tables.  ...  .$3.50 summary tablee can be aggregated. Extending existing query languages to handle multi-table queries presents new difficulties.  ... 
doi:10.1145/221270.221638 dblp:conf/cikm/NgR95 fatcat:4youkrcnyfegrezx4hx76hpa7a

Index filtering and view materialization in ROLAP environment

Shi Guang Qiu, Tok Wang Ling
2001 Proceedings of the tenth international conference on Information and knowledge management - CIKM'01  
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems.  ...  In this paper, we propose to build indexes on subsets of the primary keys rather than the full sets if the index selectivity for these smaller indexes can be maintained above the required level.  ...  In the last part of this example, we randomly get 20 queries that are running against the fact table 3 from the query set generated by query generator from [OLAP] and run these queries against views prepared  ... 
doi:10.1145/502585.502642 dblp:conf/cikm/QiuL01 fatcat:sfquw45h2rgdnpcsbbrdepww3y

Index filtering and view materialization in ROLAP environment

Shi Guang Qiu, Tok Wang Ling
2001 Proceedings of the tenth international conference on Information and knowledge management - CIKM'01  
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems.  ...  In this paper, we propose to build indexes on subsets of the primary keys rather than the full sets if the index selectivity for these smaller indexes can be maintained above the required level.  ...  In the last part of this example, we randomly get 20 queries that are running against the fact table 3 from the query set generated by query generator from [OLAP] and run these queries against views prepared  ... 
doi:10.1145/502641.502642 fatcat:m4wyri3bi5gazlny7puznqlg2m

ATLAS [chapter]

Haixun Wang, Carlo Zaniolo, Chang Richard Luo
2003 Proceedings 2003 VLDB Conference  
While, for this particular example, state contains only one tuple, it is in fact a table that can be queried and updated using SQL statements and can contain any number of tuples (see later examples).  ...  The rewriter, which makes changes to the query graphs, is a very important module, since much optimization, such as predicate push-up/push-down, UDA optimization, index selection, and in-memory table  ... 
doi:10.1016/b978-012722442-8/50118-x dblp:conf/vldb/WangZL03 fatcat:wxlwzudtm5eutbqqzltlfcgfhe

S+EPPs

Mariano P. Consens, Valeria Fionda, Shahan Khatchadourian, Giuseppe Pirrò
2015 Proceedings of the VLDB Endowment  
S+EPPs combines the query and optimization translations to enable summary-based optimization of graph traversal queries on top of off-the-shelf SPARQL processors.  ...  obtained by leveraging summaries stored alongside the original datasets.  ...  Pirrò's work was partially supported by the Cyber Security Technological District, financed by the Italian Ministry of Education, University and Research.  ... 
doi:10.14778/2824032.2824128 fatcat:sxvbgbjscfhadhwvhpms7xfazq

Speeding-up data-driven applications with program summaries

Sonia Guéhis, Virginie Goasdoué-Thion, Philippe Rigaux
2009 Proceedings of the 2009 International Database Engineering & Applications Symposium on - IDEAS '09  
In this paper, we develop a global optimization approach. We base this approach on an execution model where queries can be executed asynchronously with respect to the flow of the application program.  ...  The natural organization of database programs leads to submit an intensive flow of elementary SQL queries to the server, and exploits only locally its optimization power.  ...  Lazy, on the other hand, executes a number of queries which is exponential in the depth of the query summary. We use a modest database with a few thousands rows in each table.  ... 
doi:10.1145/1620432.1620440 dblp:conf/ideas/GuehisGR09 fatcat:5dqikls66nd27ergqrnd2tvtwm

Toward a Gold Standard for Extractive Text Summarization [chapter]

Alistair Kennedy, Stan Szpakowicz
2010 Lecture Notes in Computer Science  
Starting from this corpus, we created SCU-optimal summaries for extractive summarization. We support the claim of optimality with a series of experiments.  ...  Without generating language to express the gist of a text -its abstract -can we expect to make summaries which are both readable and informative?  ...  Acknowledgments Our research is supported by the Natural Sciences and Engineering Research Council of Canada and the University of Ottawa.  ... 
doi:10.1007/978-3-642-13059-5_9 fatcat:z7a6zdzs4ne6bd7hevtffutekm

4.-8. März 2019

Sebastian Breß, Henning Funke, Steffen Zeuch, Tilmann Rabl, Volker Markl
2019 Datenbanksysteme für Business, Technologie und Web  
Currently, database engines have to be manually optimized for each processor which is a costly and error prone process.  ...  In this paper, we provide a summary of our recent VLDB Journal publication, where we propose concepts to adapt to performance enhancements of modern processors and to exploit their capabilities automatically  ...  This work was funded by EU project E2Data (780245), DFG Priority Program "Scalable Data Management for Future Hardware" (MA4662-5) and Collaborative Research Center SFB 876, project A2, and the German  ... 
doi:10.18420/btw2019-ws-07 dblp:conf/btw/BressFZRM19 fatcat:vfmh6qio6zdorev2vj7vb6ig7e

InsightNotes

Dongqing Xiao, Mohamed Y. Eltabakh
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
We propose an extended summary-aware query processing engine for efficient manipulation and propagation of the annotation summaries in the query pipeline.  ...  We introduce several optimizations for the creation, maintenance, and zoom-in processing over the annotations summaries.  ...  However, before the re-execution, the query is optimized by pushing down the predicates p as well as the other arguments, i.e., instanceId and index, as much as possible in the query plan.  ... 
doi:10.1145/2588555.2610501 dblp:conf/sigmod/XiaoE14 fatcat:c2ifpf7dhvf2xksxl57rgg5t3a

TriAD

Sairam Gurajada, Stephan Seufert, Iris Miliaraki, Martin Theobald
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
The multi-threaded and distributed execution of joins in TriAD is facilitated by an asynchronous Message Passing protocol which allows us to run multiple join operators along a query plan in a fully parallel  ...  To our knowledge, we are thus able to report the so far fastest query response times for the above benchmarks using a mid-range server and regular Ethernet setup.  ...  EXAMPLE 7. Figure 4 shows an example of a global plan returned by the optimizer for a two-node distribution.  ... 
doi:10.1145/2588555.2610511 dblp:conf/sigmod/GurajadaSMT14 fatcat:tejrebkzsnaa7nspnbmkmorqtm

gStore

Lei Zou, Jinghui Mo, Lei Chen, M. Tamer Özsu, Dongyan Zhao
2011 Proceedings of the VLDB Endowment  
For example, we can retrieve the names of individuals who were born on February 12, 1809 and died on April 15, 1865 from the RDF dataset by the following SPARQL query: Q 1 : Select ?name Where { ?m ?  ...  In order to query RDF repositories, SPARQL query language [16] has been proposed by W3C.  ...  For example, given a query signature graph Q * (in Figure 3) and a summary graph G 3 of VS-tree (in Figure 5) , we can find one summary match {(d 3 1 , d 3 2 )}.  ... 
doi:10.14778/2002974.2002976 fatcat:e6vvdmfc7beazpyi23rkvgg6u4

Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket

Tara Safavi, Caleb Belth, Lukas Faber, Davide Mottin, Emmanuel Muller, Danai Koutra
2019 2019 IEEE International Conference on Data Mining (ICDM)  
In an evaluation with real user queries to opensource, encyclopedic KGs of up to one billion triples, we show that GLIMPSE efficiently creates summaries that outperform strong baselines by up to 19% in  ...  query answering F1 score.  ...  This material is based upon work supported by the National Science Foundation under Grant No. IIS 1845491, Army Young Investigator Award No.  ... 
doi:10.1109/icdm.2019.00063 dblp:conf/icdm/SafaviBFMMK19 fatcat:ocyem3h4bff2dpva7yl2n5zdai

COMPARE: Accelerating Groupwise Comparison in Relational Databases for Data Analytics [article]

Tarique Siddiqui, Surajit Chaudhuri, Vivek Narasayya
2021 arXiv   pre-print
We extend the database engine with optimization techniques that exploit the semantics of COMPARE to significantly improve the performance of such queries.  ...  Our extensive evaluation on synthetic and real-world datasets shows that COMPARE results in a significant speedup over existing approaches, including physical plans generated by today's database systems  ...  If one or more columns in Φ are the PK columns or have functional dependencies on the PK columns in the dimension tables , Φ can be pushed down below the join on fact table by replacing the dimension tables  ... 
arXiv:2107.11967v2 fatcat:gbsoctipivctvig74o3g5vwqim
« Previous Showing results 1 — 15 out of 128,584 results