Optimising Sargable Conjunctive Predicate Queries in the Context of Big Data

α
Veronica V.N. Akwukwuma,
Veronica V.N. Akwukwuma,
σ
Veronica V.N. Akwukwuma
Veronica V.N. Akwukwuma
ρ
Patrick O. Obilikwu
Patrick O. Obilikwu

Send Message

To: Author

Optimising Sargable Conjunctive Predicate Queries in the Context of Big Data

Article Fingerprint

ReserarchID

CSTSDE8C6N2

Optimising Sargable Conjunctive Predicate Queries in the Context of Big Data Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

With the continued increase in the volume of data, the volume dimension of big data has become a significant factor in estimating query time. When all other factors are held constant, query time increases as the volume of data increases and vice versa. To enhance query time, several techniques have come out of research efforts in this direction. One of such techniques is factorisation of query predicates. Factorisation has been used as a query optimization technique for the general class of predicates but has been found inapplicable to the subclass of sargable conjunctive equality predicates. Experiments performed exposed a peculiar nature of sargable conjunctive equality predicates based on which insight, the concatenated predicate model was formulated as capable of optimising sargable conjunctive equality predicates. Equations from research results were combined in a way that theorems describing the application and optimality of the concatenated predicate model were derived and proved. The theorems proved that the novel concatenated predicate model transforms a sargable conjunctive equality predicate such that the resultant concatenated predicate is an optimal equivalent of the sargable conjunctive equality predicate from which it is derived. The model enhances conjunctive sargable equality queries making our results capable of application in software applications, majority of whose queries are of the conjunctive query type. The results are equally useful in optimising query time within the context of Big Data where the continuous increase in the volume dimension of data calls for query structures that enhance query time.

References

56 Cites in Article
  1. Veda Storey,Il-Yeol Song (2017). Big data technologies and Management: What conceptual modeling can do.
  2. P Obilikwu,E Ogbuju (2020). A data model for enhanced data comparability across multiple organizations.
  3. M. Ali-Ud-Din Khan,Muhammad Uddin,Navarun Gupta (2014). Seven V's of Big Data Understanding Big Data to Extract Value.
  4. Ripon Patgiri,Arif Ahmed (2016). Big Data: The V's of the Game Changer Paradigm.
  5. H Matalqa,S Mustafa (2016). The Effect of Horizontal Database Table Partitioning on Query Performance.
  6. T Das,Arati Mohapatro (2014). A Study on Big Data Integration with Data Warehouse.
  7. U Tailor,P Patel (2016). A Survey on Comparative Analysis of Horizontal Scaling and Vertical Scaling of Cloud Computing Resources.
  8. M Stonebraker,U Çetintemel (2018). One size fits all: an idea whose time has come and gone.
  9. P Selinger,M Astrahan,D Chamberlin,R Lorie,T Price (1979). Access path selection in a relational database management system.
  10. I Ikeh,I Achufusi,O Aribodor,O Okeke (2021). Association of Falciparum Malaria and ABO Blood Group in Awka, Anambra State, Nigeria.
  11. Ashok Chandra,Philip Merlin (1977). Optimal implementation of conjunctive queries in relational data bases.
  12. A Levy,I Mumick,Y Sagiv (1994). Query Optimization by Predicate Move-Around.
  13. S Abiteboul,R Hull,V Vianu (1995). Foundations of Databases.
  14. Georg Gottlob,Stephanie Lee,Gregory Valiant,Paul Valiant (2012). Size and Treewidth Bounds for Conjunctive Queries.
  15. A Swami,K Scheifer (1993). Sandvik and IBM join forces in mining analytics.
  16. Martin Grohe,Thomas Schwentick,Luc Segoufin (2001). When is the evaluation of conjunctive queries tractable?.
  17. C Mohan,D Haderle,Y Wang,J Cheng (1990). Single Table Access using Multiple Indexes: Optimization, execution, and concurrency control techniques.
  18. Ramez Elmasri,S Navathe (2011). Data Management Fundamentals: Database Management System.
  19. V Garg,B Waldecker (1994). Detection of weak unstable predicates in distributed programs.
  20. M Mugnier,M Rousset,F Ulliana (2016). Ontology-Mediated Queries for NOSQL Databases.
  21. M Heimel,V Markl,K Murthy (2009). A Bayesian Approach to Estimating the selectivity of Conjunctive Predicates.
  22. X Yu,N Koudas,C Zuzarte (2006). Advances in Database Technology - EDBT 2006.
  23. Surajit Chaudhuri,Prasanna Ganesan,Sunita Sarawagi (2003). Factorizing complex predicates in queries to exploit indexes.
  24. A Kemper,G Moerkotte,K Peithner,M Steinbrunn (1994). Optimizing disjunctive queries with expensive predicates.
  25. G Lohman (2014). Is Query Optimization a 'Solved' Problem?.
  26. Surajit Chaudhuri (2012). What next?.
  27. E Codd (1970). A relational model of data for large shared data banks.
  28. D Chamberlin,M Astrahan,M Blasgen,J Gray,W King,B Lindsay,R Lorie,J Mehl,T Price,G Putzolu,F Selinger,P Schkolnick,M Slutz,D Traiger,I Wade,B Yostet,R (1981). A History and Evaluation of System R.
  29. Larry Clough,William Haseman,Yuk So (1976). Designing optimal data structures.
  30. E Codd (1975). Implementation of Relational Database Systems.
  31. Surajit Chaudhuri (1998). An overview of query optimization in relational systems.
  32. Yannis Ioannidis (2003). The History of Histograms (abridged).
  33. Bin Cao,Antonio Badia (2005). A nested relational approach to processing SQL subqueries.
  34. K Munir,M Anjum (2017). The use of ontologies for effective knowledge modelling and information retrieval.
  35. S Vellev (2009). Automata Theory based Approach to the Join Ordering Problem in Relational Database Systems.
  36. G Bamnote,S Agrawal (2013). Introduction to Query Processing and Optimization.
  37. Jeffrey Ullman (1989). New frontiers in database system research.
  38. D Chimenti,R Gamboa,R Krishnamurthy (1989). 15th International Conference on Very Large Data Bases RAI Congress Centre, Amsterdam, The Netherlands 22–25 August 1989.
  39. S Chaudhuri,K Shim (1993). Query optimization in the presence of foreign functions.
  40. Joseph Hellerstein,Michael Stonebraker (1993). Predicate migration.
  41. Surajit Chaudhuri,Luis Gravano (1996). Optimizing queries over multimedia repositories.
  42. S Chaudhuri,K Shim (1999). Optimization of queries with user-defined predicates.
  43. A Kemper,G Moerkotte,M Steinbrunn (1992). Controlled redundancy in object bases: optimization methods for organizational data modelling.
  44. P Balasubramanian,R Arisaka (2007). A Set Theory Based Factoring Technique and Its Use for Low Power Logic Design.
  45. R Brayton,R Rudell,A Sangiovanni-Vincentelli,A Wang (1987). MIS: A Multiple-Level Logic Optimization System.
  46. Lewis Reinwald,Richard Soland (1966). Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time.
  47. M Muralikrishna,David Dewitt (1988). Optimization of multiple-relation multiple-disjunct queries.
  48. Joseph Hellerstein (1994). Practical predicate placement.
  49. S Deen (1982). 2nd International Very Large Vehicles Conference.
  50. S Deen,R Amin,M Taylor (1994). A Strategy for Decomposing Complex Queries in a Heterogeneous DDB.
  51. Oracle (2017). Oracle Sharding Linear Scalability, Fault Isolation and Geo-distribution for Web-scale OLTP Applications.
  52. H Sander-Bruggink,B Konig,S Kupper (2012). Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories.
  53. C Lynch,M Stonebraker (1988). Extended User-Defined Indexing with Application to Textual Databases.
  54. S Harkins (2011). 10 Tips for Choosing between a Surrogate and Natural Primary Key.
  55. P Valduriez (1987). Join Indices.
  56. Lise Getoor,Ashwin Machanavajjhala (2012). Entity resolution.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Veronica V.N. Akwukwuma,. 2026. \u201cOptimising Sargable Conjunctive Predicate Queries in the Context of Big Data\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 22 (GJCST Volume 22 Issue C1): .

Download Citation

Enhances big data query processing using conjunctive techniques for improved accuracy and efficiency.
Issue Cover
GJCST Volume 22 Issue C1
Pg. 19- 32
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification: I.2.4
Version of record

v1.2

Issue date

July 16, 2022

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2863
Total Downloads: 40
2026 Trends
Related Research

Published Article

With the continued increase in the volume of data, the volume dimension of big data has become a significant factor in estimating query time. When all other factors are held constant, query time increases as the volume of data increases and vice versa. To enhance query time, several techniques have come out of research efforts in this direction. One of such techniques is factorisation of query predicates. Factorisation has been used as a query optimization technique for the general class of predicates but has been found inapplicable to the subclass of sargable conjunctive equality predicates. Experiments performed exposed a peculiar nature of sargable conjunctive equality predicates based on which insight, the concatenated predicate model was formulated as capable of optimising sargable conjunctive equality predicates. Equations from research results were combined in a way that theorems describing the application and optimality of the concatenated predicate model were derived and proved. The theorems proved that the novel concatenated predicate model transforms a sargable conjunctive equality predicate such that the resultant concatenated predicate is an optimal equivalent of the sargable conjunctive equality predicate from which it is derived. The model enhances conjunctive sargable equality queries making our results capable of application in software applications, majority of whose queries are of the conjunctive query type. The results are equally useful in optimising query time within the context of Big Data where the continuous increase in the volume dimension of data calls for query structures that enhance query time.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Optimising Sargable Conjunctive Predicate Queries in the Context of Big Data

Veronica V.N. Akwukwuma
Veronica V.N. Akwukwuma
Patrick O. Obilikwu
Patrick O. Obilikwu

Research Journals