Filters








402,145 Hits in 4.2 sec

Sparql query processing in relational databases

Ju Ri Kim, Zhanfang Zhao, Sung Kook Han
2018 International Journal of Engineering & Technology  
This kind of conceptual level mapping also can provide efficient SPARQL query processing in RDB.Improvements/Applications: The paper realizes SPARQL query processing in RDB, which is based on conceptual  ...  The paper also presents SPARQL query processing in RDB.Findings: There are distinct differences between instance level mapping and conceptual level mapping for RDB2RDF.  ...  Fig. 5 : 5 SPARQL Query Processing in RDB.  ... 
doi:10.14419/ijet.v7i2.33.13860 fatcat:xoolr2gxdjfhvpka4wjrbzerj4

Processing Recommender Top-N Queries in Relational Databases

Liang Zhu
2015 Journal of Software  
According to the feedback information from a user in the result sets of initial or previous queries, we present in this paper a framework for processing recommender top-N queries in relational databases  ...  A knowledge base is created to store the related information of the tuples in the underlying database for evaluating the recommender query.  ...  Acknowledgment This work is supported in part by NSFC (61170039) and the NSF of Hebei Province (F2012201006).  ... 
doi:10.17706/jsw.10.2.162-171 fatcat:ijzsnpeeqfc2zafo5zn4g3zlha

SPARQL Query Processing with Conventional Relational Database Systems [chapter]

Stephen Harris, Nigel Shadbolt
2005 Lecture Notes in Computer Science  
This paper describes an evolution of the 3store RDF storage system, extended to provide a SPARQL query interface and informed by lessons learned in the area of scalable RDF storage.  ...  Federate Federate [6] is a relational database gateway, which maps RDF queries to existing database structures.  ...  Its goal is for compatibility with existing relational database systems, rather than as a native RDF storage and querying engine.  ... 
doi:10.1007/11581116_25 fatcat:ttciw7deajhdrosb3qkee7jaou

Processing of Top-k Selection Queries in Relational Database System

Neha Singh, P.K. Pandey
2014 IOSR Journal of Computer Engineering  
In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that traditional relational database management systems can process efficiently  ...  In this work, we also consider processing such top-k queries under the constraint that the result items are members of a specific set, which is provided at query time it is also known as set-defined selection  ...  For this, the NoRestarts strategy defines R' in a pessimistic way: n i=1 Processing of Top-k Selection Queries in Relational Database System Given a histogram bucket b, the corresponding tuple t b that  ... 
doi:10.9790/0661-16375460 fatcat:5vea7rbbizburjfnpm34bsc44y

Query processing strategies in the PASCAL/R relational database management system

Matthias Jarke, Joachim W. Schmidt
1982 Proceedings of the 1982 ACM SIGMOD international conference on Management of data - SIGMOD '82  
QUERY PROCESSING STRATEGIES IN THE PASCAL/R RELATIONAL DATABASE MANAGEMENT SYSTEM ABSTRACT : In the database programming language PASCAL/R, the programming language PASCAL and concepts based on the relational  ...  In section 4, we investigate how to transform queries in order to reduce the processing effort.  ... 
doi:10.1145/582353.582402 dblp:conf/sigmod/JarkeS82 fatcat:w5jrqga555go3jqjcmdc3irghe

Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases

Jost Enderle, Nicole Schneider, Thomas Seidl
2005 Very Large Data Bases Conference  
Based on the Relational Interval Tree, we present various indexing schemes that support such combined queries and can be integrated in relational database systems with minimum effort.  ...  With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems.  ...  In [22] , an efficient access structure has been introduced to process interval intersection queries on top of any existing relational database system.  ... 
dblp:conf/vldb/EnderleSS05 fatcat:ptc3hekeibcwrnoe6txdsrlvlq

Dynamic Query Processing and Optimization in Relational Complex Databases with Keyword Search

Remya Raj
2014 IOSR Journal of Computer Engineering  
Modern scientific databases and web databases maintain large and heterogeneous data. These realworld databases contain over hundreds or even thousands of relations and attributes.  ...  Different from traditional document retrieval users in database retrieval are capable of performing different round of actions iteratively by filling in forms and retrieving results based on users desire  ...  Acknowledgment The authors wish to thank the Management and Principal and Head of the Department(CSE) of Ilahia College of Engineering and Technology for their support and help in completing this work.  ... 
doi:10.9790/0661-16534249 fatcat:oaqlhseabbbqtabvbagnke4bwm

Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations

Ke Yi, Feifei Li, G. Kollios, D. Srivastava
2008 IEEE Transactions on Knowledge and Data Engineering  
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations.  ...  Our results significantly improve the best known algorithms for top-k query processing in uncertain databases, in terms of both runtime and memory usage.  ...  Yi's research was supported in part by Hong Kong Direct Allocation Grant (DAG07/08). Feifei Li's research was supported in part by US National Science Foundation grant CT-ISG-0831278.  ... 
doi:10.1109/tkde.2008.90 fatcat:gfg555bn2nhzvnhpmxmn45xqla

Comprehensive Analytics of Large Data Query Processing on Relational Database with SSDs [chapter]

Keisuke Suzuki, Yuto Hayamizu, Daisaku Yokoyama, Miyuki Nakano, Masaru Kitsuregawa
2014 Lecture Notes in Computer Science  
Solid-state drives (SSDs) are widely used in large data processing applications due to their higher random access throughput than HDDs and capability of parallel I/O processing.  ...  Overall, our analytics clarify that the performance of multiple queries in SSD-based databases can be improved by considering data access locality of the hashjoin operation and determining the appropriate  ...  Related Work Recently, there has been much research in the area of SSD-integrated database systems.  ... 
doi:10.1007/978-3-319-08608-8_12 fatcat:kkwqxsndpvgr5ptahftbwxypae

XML Data Storage and Query Optimization in Relational Database by XPath Processing Model

Xiaojie Yuan, Xiangyu Hu, Dongxing Wu, Haiwei Zhang, Xin Lian
2013 Journal of Software  
Along with the growth of XML data, traditional relational databases support XML data processing across-the-board.  ...  This work presents mechanisms of Storage and query optimization for XML data in relational database.  ...  XML data was stored in relational database PostgreSQL and XPath query processing was also implemented in PostgreSQL.  ... 
doi:10.4304/jsw.8.4.809-816 fatcat:fs3fsuil2rfyjj4nfei3xbkqmy

Sequence query processing

Praveen Seshadri, Miron Livny, Raghu Ramakrishnan
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
Many applications require the ability to manipulate sequences of data, We motivate the importance of sequence query processing, and present aframework for the optimization of sequence queries based on  ...  We present a bottom-up algorithm that generates an efficient query evaluation plan based on cost estimates. This work also identifies a number of directions in which future research can be directed.  ...  Algebraic optimization in a relational model for temporal databases.  ... 
doi:10.1145/191839.191926 dblp:conf/sigmod/SeshadriLR94 fatcat:xmymppgombhnviicwk27p5r5hi

Adaptive Query Processing

Amol Deshpande, Zachary Ives, Vijayshankar Raman
2007 Foundations and Trends in Databases  
processing in general.  ...  This has led to a plethora of new techniques, generally placed under the common banner of adaptive query processing, that focus on using runtime feedback to modify query processing in a way that provides  ...  Query Processing in Relational Database Systems The conventional method of processing a query in a relational DBMS is to parse the SQL statement and produce a relational calculus-like logical representation  ... 
doi:10.1561/1900000001 fatcat:oqg667kvabfqfd5kvydxmkcej4

Reverse Query Processing

Carsten Binnig, Donald Kossmann, Eric Lo
2007 2007 IEEE 23rd International Conference on Data Engineering  
Traditionally, query processing gets a query and a database instance as input and returns the result of the query for that particular database instance.  ...  RQP Overview Problem Statement As mentioned in the introduction, this paper addresses the following problem for relational databases.  ...  Other potential applications involve updating views and database sampling. Reverse query processing is carried out in a similar way as traditional query processing.  ... 
doi:10.1109/icde.2007.367896 dblp:conf/icde/BinnigKL07 fatcat:z5ckfpknrffqpfrzr7vkyt4isi

Sequence query processing

Praveen Seshadri, Miron Livny, Raghu Ramakrishnan
1994 SIGMOD record  
Many applications require the ability to manipulate sequences of data, We motivate the importance of sequence query processing, and present aframework for the optimization of sequence queries based on  ...  We present a bottom-up algorithm that generates an efficient query evaluation plan based on cost estimates. This work also identifies a number of directions in which future research can be directed.  ...  Algebraic optimization in a relational model for temporal databases.  ... 
doi:10.1145/191843.191926 fatcat:drmsxcgarbcbdabdfq7xkpo2nq

Speculative Query Processing

Neoklis Polyzotis, Yannis E. Ioannidis
2003 Conference on Innovative Data Systems Research  
In particular, based on the features of the partial query specified at any point, the interface prepares the database by issuing asynchronous manipulations to it that are likely to make the final query  ...  We draw inspiration from these techniques and introduce speculation to query processing.  ...  Related Work Query caching and self-tuning systems represent applications of speculation in database systems.  ... 
dblp:conf/cidr/PolyzotisI03 fatcat:feofbiz23fczhgrwcuoeawifqu
« Previous Showing results 1 — 15 out of 402,145 results