Filters








811 Hits in 4.8 sec

Efficient processing of complex similarity queries in RDBMS through query rewriting

Caetano Traina, Agma J. M. Traina, Marcos R. Vieira, Adriano S. Arantes, Christos Faloutsos
2006 Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06  
In this work we propose a simple and effective set of algorithms that can be combined to answer complex similarity queries, and a set of algebraic rules useful to rewrite similarity query expressions into  ...  Whereas there are many works dealing with algorithms to answer basic similarity predicates, there are not generic algorithms able to efficiently handle similarity complex queries combining several basic  ...  A RDBMS supporting multimedia data demands efficient ways to answer complex similarity queries.  ... 
doi:10.1145/1183614.1183620 dblp:conf/cikm/TrainaTVAF06 fatcat:jsk3na42knbjdpu3ot6s6bpqki

Integrating user preference to similarity queries over medical images datasets

Monica R. P. Ferreira, Marcelo Ponciano-Silva, Agma J. M. Traina, Caetano Traina, Sandra de Amo, Fabiola S. F. Pereira, Richard Chbeir
2010 2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS)  
Experiments performed over a dataset with CT lung images shows that correctly expressing the user's preferences, the similarity query precision can increase from an average of 60% up to close to 100%,  ...  In this paper, we propose a technique to allow expressing the user's preference over attributes associated to the images, so similarity queries can be refined by preference rules.  ...  The RDBMS used to process the traditional part of the query was PostgreSQL.  ... 
doi:10.1109/cbms.2010.6042693 dblp:conf/cbms/FerreiraPTTAPC10 fatcat:xchxkbzfrvgdhajtzpnhpojns4

RDFViewS

François Goasdoué, Konstantinos Karanasos, Julien Leblay, Ioana Manolescu
2010 Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM '10  
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue.  ...  In this paper, we present RDFViewS, a system capable of choosing the most suitable views to materialize, in order to minimize the query response time for a specific SPARQL query workload, while taking  ...  This size effect and the complexity and irregularity of RDF data pose significant challenges to the task of building an efficient query evaluation engine.  ... 
doi:10.1145/1871437.1871778 dblp:conf/cikm/GoasdoueKLM10 fatcat:dy2eielm7jdcjds4c6likt5ena

RDFViewS: A Storage Tuning Wizard for RDF Applications [article]

François Goasdoué, Konstantinos Karanasos (INRIA Saclay - Ile de France), Julien Leblay, Ioana Manolescu
2010 arXiv   pre-print
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue.  ...  In this paper, we present RDFViewS, a system capable of choosing the most suitable views to materialize, in order to minimize the query response time for a specific SPARQL query workload, while taking  ...  This size effect and the complexity and irregularity of RDF data pose significant challenges to the task of building an efficient query evaluation engine.  ... 
arXiv:1008.2186v1 fatcat:cxqdsqydondd7fl7ou53klr6r4

QMapper for Smart Grid

Yue Wang, Yingzhong Xu, Yue Liu, Jian Chen, Songlin Hu
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
In this paper, we propose QMapper, a tool for automatically translating SQL into proper HiveQL. QMapper consists of a rule-based rewriter and a cost-based optimizer.  ...  However, enterprise big data processing systems such as Smart Grid applications often have to migrate their RDBMS-based legacy applications to Hive rather than directly writing new logic in HiveQL.  ...  QMAPPER OVERVIEW Query Rewriter : The Query Rewriter is composed of two phases. In the first phase, a Rule-Based Rewriter (RBR) checks if a query matches a series of static rules.  ... 
doi:10.1145/2723372.2742792 dblp:conf/sigmod/WangXLCH15 fatcat:nh5ipmuue5eyzgs5z6rwwrh5ym

Nondeterministic Queries in a Relational Grid Information Service

Peter A. Dinda, Dong Lu
2003 Proceedings of the 2003 ACM/IEEE conference on Supercomputing - SC '03  
We implement nondeterministic queries using a combination of query rewriting, schema extensions, indices, and randomness. No changes to the RDBMS are needed.  ...  of a query largely independent of query complexity.  ...  Because the query is declarative, there is significant room for the query optimizer in the RDBMS to make the query efficient.  ... 
doi:10.1145/1048935.1050163 dblp:conf/sc/DindaL03 fatcat:kirzxpdwwbcr7luxatjbgsczse

Native support of multi-tenancy in RDBMS for software as a service

Oliver Schiller, Benjamin Schiller, Andreas Brodt, Bernhard Mitschang
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
This is complex, disables some optimization opportunities in the RDBMS and represents a conceptual misstep with Separation of Concerns in mind.  ...  Therefore, we contribute first features of a RDBMS to support tenant-aware data management natively.  ...  To reduce the complexity of the query rewriter, the RDBMS may take over some of its functionality by means of SQL views and INSTEAD-OF triggers.  ... 
doi:10.1145/1951365.1951382 dblp:conf/edbt/SchillerSBM11 fatcat:yiyd5u2oufcapa6vmvlc3nmhd4

Multistore Big Data Integration with CloudMdsQL [chapter]

Carlyna Bondiombouy, Boyan Kolev, Oleksandra Levchenko, Patrick Valduriez
2016 Lecture Notes in Computer Science  
data processing frameworks by allowing the ad-hoc usage of user defined map/filter/reduce operators in combination with traditional SQL statements.  ...  Furthermore, our solution allows for optimization by enabling subquery rewriting so that bind join can be used and filter conditions can be pushed down and applied by the data processing framework as early  ...  Subquery rewriting takes place in order to request early execution of some operators and thus to increase its overall efficiency.  ... 
doi:10.1007/978-3-662-53455-7_3 fatcat:iua5xhkl45hm3be5g4j5w2neum

Query processing in multistore systems: an overview

Carlyna Bondiombouy, Patrick Valduriez
2016 International Journal of Cloud Computing  
In this paper, we give an overview of query processing in multistore systems.  ...  In this paper, we give an overview of query processing in multistore systems. We start by introducing the recent cloud data management solutions and query processing in multidatabase systems.  ...  Thus, query processing involves view-based query rewriting.  ... 
doi:10.1504/ijcc.2016.10001884 fatcat:jpuixv6mxzhmdkuqrmqbgbbl24

Query processing in multistore systems: an overview

Carlyna Bondiombouy, Patrick Valduriez
2016 International Journal of Cloud Computing  
In this paper, we give an overview of query processing in multistore systems.  ...  In this paper, we give an overview of query processing in multistore systems. We start by introducing the recent cloud data management solutions and query processing in multidatabase systems.  ...  Thus, query processing involves view-based query rewriting.  ... 
doi:10.1504/ijcc.2016.080903 fatcat:etteedwysbcyfidbaeh7x2lrne

PIVOT and UNPIVOTOptimization and Execution Strategies in an RDBMS [chapter]

C CUNNINGHAM, C GALINDOLEGARIA, G GRAEFE
2004 Proceedings 2004 VLDB Conference  
We discuss query optimization and execution implications of this integrated design and evaluate the performance of this approach using a prototype implementation in Microsoft SQL Server.  ...  Such a design provides opportunities for better performance, both during query optimization and query execution.  ...  outside of query processing.  ... 
doi:10.1016/b978-012088469-8/50087-5 fatcat:eyyabip5ijfjld5eb6jxm4bg2m

Composite-object views in relational DBMS: An implementation perspective [chapter]

H. Pirahesh, B. Mitschang, N. Südkamp, B. Lindsay
1994 Lecture Notes in Computer Science  
With this technique, the performance of navigation through COs, which has been of a concern in RDBMSs in the past, is in fact quite satisfactory.  ...  We show that such a major extension to the data model is in fact quite attractive both in terms of implementation cost and query performance.  ...  This allows fast access to objects and navigation through them. In RDBMSs, objects (tuples) are kept in RDBMS address space.  ... 
doi:10.1007/3-540-57818-8_38 fatcat:rwohsgkcqvbvvkjrw7vwbzbkt4

Semantic Data Management: Towards Querying Data with their Meaning

Lipyeow Lim, Haixun Wang, Min Wang
2007 2007 IEEE 23rd International Conference on Data Engineering  
Our framework persists taxonomies contained in ontologies by leveraging XML support in hybrid relational-XML DBMSs (e.g., IBM's DB2 v9) and rewrites ontology-based semantic matching queries using the industry-standard  ...  query languages, SQL/XML and XQuery.  ...  Instead, the rule rewriting and the optimization mechanism will decide how to map the query in the most efficient way into XPath expressions that access the ontology.  ... 
doi:10.1109/icde.2007.369030 dblp:conf/icde/LimWW07 fatcat:mpuoro4nprhftfjyc3pir4iumu

Data Management in Machine Learning

Arun Kumar, Matthias Boehm, Jun Yang
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
We focus on three complementary lines of work: (1) integrating ML algorithms and languages with existing data systems such as RDBMSs, (2) adapting data management-inspired techniques such as query optimization  ...  Finally, we identify key open data management challenges for future research in this important area.  ...  Furthermore, there are domain-specific data structures such as a skip list for I/O-efficient processing of forecasting queries [41] .  ... 
doi:10.1145/3035918.3054775 dblp:conf/sigmod/Kumar0017 fatcat:zph46pk72vc5nn3axspvvuxpx4

GeMBASE [chapter]

Simone Santini, Amarnath Gupta
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
Query rewriting in GemBASE is rule-based, and the rule set can be extended or edited remotely through a Java-based rule editor.  ...  At this time, the cost-based optimizer of Figure 1 is not fully implemented, so that the rewriting process is purely rule-based.  ... 
doi:10.1016/b978-155860869-6/50112-8 dblp:conf/vldb/SantiniG02 fatcat:ccxdkc6s5fbv7bfqpo6pwc4kpe
« Previous Showing results 1 — 15 out of 811 results