Filters








49 Hits in 5.1 sec

Beyond Equi-joins: Ranking, Enumeration and Factorization [article]

Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
2021 arXiv   pre-print
In addition to providing the first non-trivial theoretical guarantees beyond equi-joins, we show in an experimental study that our ranked-enumeration approach is also memory-efficient and fast in practice  ...  This is within a polylogarithmic factor of the best known complexity for equi-joins and even of 𝒪(n+k), the time it takes to look at the input and return k answers in any order.  ...  This work was supported in part by the National Science Foundation (NSF) under award numbers CAREER IIS-1762268 and IIS-1956096.  ... 
arXiv:2101.12158v3 fatcat:hi6su4vlsbdq7cc2hd3mnquxam

Approximate tensor decomposition within a tensor-relational algebraic framework

Mijung Kim, Kasim Selçuk Candan
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
This leads to a highly efficient, effective, and easy-to-parallelize join-by-decomposition approach and a corresponding KL-divergence based optimization strategy.  ...  In this paper, we first introduce a tensor-based relational data model and define algebraic operations on this model.  ...  equi-join attributes in the query).  ... 
doi:10.1145/2063576.2063827 dblp:conf/cikm/KimC11 fatcat:woiiz66qmvdxhkr7cpxkua27u4

Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries [article]

Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer, Mirek Riedewald, Xiaofeng Yang
2020 arXiv   pre-print
We study ranked enumeration of join-query results according to very general orders defined by selective dioids.  ...  Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes seemingly different problems that had been studied in isolation.  ...  Ngo for reading drafts of this paper and providing valuable feedback.  ... 
arXiv:1911.05582v3 fatcat:6o76icz54fhhtcduouv64udvvu

Sketch-Based Summarization of Ordered XML Streams

Veronica Mayorga, Neoklis Polyzotis
2009 Proceedings / International Conference on Data Engineering  
At the heart of our approach lies an efficient transform that reduces a continuous XML query to an equi-join query over relational streams.  ...  We present an extensive experimental study on real-life and synthetic data sets that validates the effectiveness of our approach and demonstrates its advantages over existing techniques.  ...  (This stems from the fact that start and end positions are unique and therefore the equi-join of DCover and DCut will never contain unit-length intervals.)  ... 
doi:10.1109/icde.2009.107 dblp:conf/icde/MayorgaP09 fatcat:xndmddnhqzc6dlstnnnyrrt6ju

Polynomial heuristics for query optimization

Nicolas Bruno, Cesar Galindo-Legaria, Milind Joshi
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
In this paper we propose a heuristic approach to very efficiently obtain execution plans for complex queries, which takes into account the presence of indexes and goes beyond simple join reordering.  ...  Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans.  ...  Now consider a slightly different example without an equi-join, namely A a<b B.  ... 
doi:10.1109/icde.2010.5447916 dblp:conf/icde/BrunoGJ10 fatcat:zexsoi7gifas7h6y2kjksiemby

Ranked Enumeration of Join Queries with Projections [article]

Shaleen Deep, Xiao Hu, Paraschos Koutris
2022 arXiv   pre-print
In this paper, we initiate the study of the problem of enumerating results in ranked order for queries with projections.  ...  Recent work has made considerable progress in identifying optimal algorithms for ranked enumeration of join queries that do not contain any projections.  ...  This research was supported in part by National Science Foundation grants CRII-1850348 and III-1910014.  ... 
arXiv:2201.05566v1 fatcat:sn4l5orwmratjfd55zzv52qnqe

SOFA: An Extensible Logical Optimizer for UDF-heavy Dataflows [article]

Astrid Rheinländer, Arvid Heise, Fabian Hueske, Ulf Leser, Felix Naumann
2013 arXiv   pre-print
Our experiments reveal that SOFA finds efficient plans, outperforming the best plans found by its competitors by a factor of up to 6.  ...  SOFA is a novel and extensible optimizer for UDF-heavy dataflows.  ...  We thank Martin Beckmann and Anja Kunkel for help with implementing the Meteor queries we used for evaluation, and we thank Volker Markl and Stephan Ewen for valuable discussion and feedback.  ... 
arXiv:1311.6335v1 fatcat:3sojpzy65vbgnetjygme655hwa

Synthesizing highly expressive SQL queries from input-output examples

Chenglong Wang, Alvin Cheung, Rastislav Bodik
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
(2) instantiating the found abstract queries and ranking the results.  ...  In this paper, we present a new scalable and efficient algorithm to synthesize SQL queries from I/O examples.  ...  from Adobe, Amazon, and Google.  ... 
doi:10.1145/3062341.3062365 dblp:conf/pldi/WangCB17 fatcat:ap2kzhjks5cinofsafl3xxs3oe

SEMA-JOIN

Yeye He, Kris Ganjam, Xu Chu
2015 Proceedings of the VLDB Endowment  
Traditional equi-join cannot handle such joins automatically, and the user typically has to manually find an intermediate mapping table in order to perform the desired join.  ...  Given the growing demand for adhoc data analysis, we have seen an increasing number of scenarios where the desired join relationship is not equi-join.  ...  A naive equi-join using string equality comparison would obviously fail. Figure 2 gives another such example.  ... 
doi:10.14778/2824032.2824036 fatcat:cqwgtohb5vb4bkdjqsasgaomqi

Query optimization in compressed database systems

Zhiyuan Chen, Johannes Gehrke, Flip Korn
2001 SIGMOD record  
We then formalize the problem of compressionaware query optimization and propose one provably optimal and two fast heuristic algorithms for selecting a query plan for relational schemas with compressed  ...  We show that eager and lazy decompression strategies produce suboptimal plans for queries involving compressed string attributes.  ...  We thank Praveen Seshadri, Philippe Bonnet, Divesh Srivastava, and Tobias Mayr for useful discussions.  ... 
doi:10.1145/376284.375692 fatcat:ywafbjusfbhglgpydevo2pdzly

Query optimization in compressed database systems

Zhiyuan Chen, Johannes Gehrke, Flip Korn
2001 Proceedings of the 2001 ACM SIGMOD international conference on Management of data - SIGMOD '01  
We then formalize the problem of compressionaware query optimization and propose one provably optimal and two fast heuristic algorithms for selecting a query plan for relational schemas with compressed  ...  We show that eager and lazy decompression strategies produce suboptimal plans for queries involving compressed string attributes.  ...  We thank Praveen Seshadri, Philippe Bonnet, Divesh Srivastava, and Tobias Mayr for useful discussions.  ... 
doi:10.1145/375663.375692 dblp:conf/sigmod/ChenGK01 fatcat:xtfvacb2rfbbhbuxcivbkn3tia

Efficient processing of enumerative set-based queries

Guoping Wang, Chee-Yong Chan
2016 Information Systems  
Such set-based queries (SQs) can be broadly classified into two types: optimization SQs that involve some optimization constraint and enumerative SQs that do not have any optimization constraint.  ...  In the enumeration phase, we apply existing rank join algorithms [31] to incrementally produce the ranked answer sets for each vbset and apply the well-known T A algorithm [32] to retrieve the top-k  ...  Following the same principle to avoid duplicates in [11] , the self-join of Ci−1 to compute Ci has (i − 2) equi-join predicates requiring that two matching tuples in Ci−1 (representing two (i − 1)-sets  ... 
doi:10.1016/j.is.2015.08.005 fatcat:pm4vz3ibpzfi5o5my6pngn6fau

GrubJoin: An Adaptive, Multi-Way, Windowed Stream Join with Time Correlation-Aware CPU Load Shedding

Bugra Gedik, Kun-Lung Wu, Philip S. Yu, Ling Liu
2007 IEEE Transactions on Knowledge and Data Engineering  
The output rate can be unnecessarily and severely degraded because tuple dropping does not recognize time correlations likely to exist among the streams.  ...  of possible multi-way join sequences involving various segments of individual join windows, GrubJoin faces a set of unique challenges, such as determining the optimal window harvesting configuration and  ...  However, this approach only works for equi-joins.  ... 
doi:10.1109/tkde.2007.190630 fatcat:aui5yahgfzbg5hzc64qfkmloz4

Customizable and scalable fuzzy join for big data

Zhimin Chen, Yue Wang, Vivek Narasayya, Surajit Chaudhuri
2019 Proceedings of the VLDB Endowment  
and scalability characteristics.  ...  We observe speedups exceeding 50X compared to the best-known prior scale-out technique, and close to linear scalability with data size and number of nodes. PVLDB Reference Format:  ...  Intermediate result sizes, and therefore the data shuffling cost during the execution of the equi-join step can be very large.  ... 
doi:10.14778/3352063.3352128 fatcat:tivtx23fengxfeayv6hv25eh6y

Optimization of multi-domain queries on the web

Daniele Braga, Stefano Ceri, Florian Daniel, Davide Martinenghi
2008 Proceedings of the VLDB Endowment  
preserves the ranking order in which search services return results; (d) introducing crossdomain joins as first-class operation within plans; (e) evaluating the query plans against several cost metrics  ...  Who are the strongest experts on service computing based upon their recent publication record and accepted European projects?  ...  Acknowledgements All authors acknowledge support from Italian project "New technologies and tools for the integration of Web search services", PRIN Call 2007-08.  ... 
doi:10.14778/1453856.1453918 fatcat:7snmvecq4vafxnfywloubqn7qq
« Previous Showing results 1 — 15 out of 49 results