Results 31 to 40 of about 247,233 (313)
Efficient Multi-way Theta-Join Processing Using MapReduce [PDF]
, 2012 Multi-way Theta-join queries are powerful in describing complex relations and therefore widely employed in real practices. However, existing solutions from traditional distributed and parallel databases for multi-way Theta-join queries cannot be easily ...
Chen, Lei, Wang, Min, Zhang, Xiaofei
core +3 more sources
Universal algorithm of processing of requests with use of parallel technology [PDF]
Научно-технический вестник Брянского государственного университета, 2018 Processing and storage of a large amount of information is one of the difficult and interesting tasks at the moment. The performance of the system as a whole depends on how well the performance and reliability of the database are implemented.
Timofeeva N.E., Dmitrieva K.A.
doaj +1 more source
Better Semijoins Using Tuple Bit-Vectors [PDF]
, 1994 This paper presents the idea of "tuple-bit-vectors" for distributed query processing. Using tuple bit-vectors, a new two-way semijoin operator called 2SJ++ that enhances the semijoin with an essentially "free" backward reduction capability is proposed ...
Li, Zhe, Ross, Kenneth A.
core +2 more sources
DISPAQ: Distributed Profitable-Area Query from Big Taxi Trip Data
Sensors, 2017 One of the crucial problems for taxi drivers is to efficiently locate passengers in order to increase profits. The rapid advancement and ubiquitous penetration of Internet of Things (IoT) technology into transportation industries enables us to provide ...
Fadhilah Kurnia Putri +3 more
doaj +1 more source
Journal of Computing and Information Technology, 2016 CIT's September 2016 issue brings seven papers whose topics fall in the broader areas of computer networks, distributed computing and query languages. Three networking papers address topics related to Mobile Ad-Hoc Networks (MANETs), while three other ...
Vlado Glavinić
doaj +1 more source
Efficient Subgraph Matching on Billion Node Graphs [PDF]
, 2012 The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc.
Li, Jianzhong +4 more
core +2 more sources
10381 Summary and Abstracts Collection -- Robust Query Processing [PDF]
, 2011 Dagstuhl seminar 10381 on robust query processing (held 19.09.10 - 24.09.10) brought together a diverse set of researchers and practitioners with a broad range of expertise for the purpose of fostering discussion and collaboration regarding causes ...
+4 more
core +1 more source
Distributed top-k aggregation queries at large [PDF]
, 2009 Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network.
A. Marian +16 more
core +2 more sources
Performance Evaluation of Query Plan Recommendation with Apache Hadoop and Apache Spark
Mathematics, 2022 Access plan recommendation is a query optimization approach that executes new queries using prior created query execution plans (QEPs). The query optimizer divides the query space into clusters in the mentioned method.
Elham Azhir +3 more
doaj +1 more source
Distributed Similarity Queries in Metric Spaces
Data Science and Engineering, 2019 Similarity queries, including range queries and k nearest neighbor (kNN) queries, in metric spaces have applications in many areas such as multimedia retrieval, computational biology and location-based services.
Keyu Yang +5 more
doaj +1 more source