An enhanced 4-way technique using cookies for robust authentication process in wireless network

Pankaj, Dadheech; Kumar, Ankit; Choudhary, Chothmal; Beniwal, Mahender Kumar; Dogiwal, Sanwta Ram; Agarwal, Basant

doi:10.1080/09720510.2019.1609557

Cited by 33 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we can see the different types of game format as International, Ranzi, T-20, IPL. Bat like left handed or right handed which defines that which types of batsman basically play the types of game [17]. Here there are two types of player male cricket player or female cricket player at last through the binary number interpretation we will decide whose player have won the man of the tournament in which type of cricket format here '1' indicate the condition is satisfying and '0' indicate the condition is collapsing.…”

Section: Fig 2 Representation Of Bitmaps Of Unique Attribute Value Methodology Bitmap Indexmentioning

confidence: 99%

An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization

Preetha¹

2021

TURCOMAT

View full text Add to dashboard Cite

Compression technique is basically used to compress the size of table or reduce the storage area. Oracle already gives this feature for the table compression as well as for the index compression. when index is created on particular column of a table then it contain some space, which require some storage or disk space by this technique we can save our disk space because in industry the company have to purchase the disk space according to the size of the their data and pay according to their disk space. To utilize this disk space for useful records data rather than wasting it. In this paper used the data pump utility for the compression of Bitmap index and table. Data pump utility performed for the logical backups in database.in this paper implemented data pump for compression, to release the space and change the index pointing location. It will not release the space even after deletion of records. This is of special interest for the case to compress the bitmap index and table space along with the’S (Data Manipulation Language).

show abstract

Section: Fig 2 Representation Of Bitmaps Of Unique Attribute Value Methodology Bitmap Indexmentioning

confidence: 99%

An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization

Preetha¹

2021

TURCOMAT

View full text Add to dashboard Cite

show abstract

“…The Mutagenesis database holds of 230 entities of molecules which are further sub classified into two groups with 188 molecules which acts as the entities which are regression friendly and 42 molecules acting as regression unfriendly. In friendly section it contains 4893 entities which represents atoms schema and 5243 entities which represents bonds and in other set it contains 1001 and 1066 respectively [14]. The mutagenesis database consists of five levels of background knowledge viz.…”

Section: Comparison Between Mrdtl and Previous Approachesmentioning

confidence: 99%

Design and Analysis of Hybrid Classification Approaches Across Multi-Relational Decision Tree Learning Algorithm

Michael¹

2021

Advances in Parallel Computing

View full text Add to dashboard Cite

In today’s day of Modern era when the data handling objectives are getting bigger and bigger with respect to volume, learning and inferring knowledge from complex data becomes the utmost problem. Almost all of the real-world information are maintained under a relational fashion holding multiple relations unlike orthodox approaches containing single relational as a whole. Moreover several fields viz. biological informatics, microbiology, chemical computations needed some more dependable and expressive approach which can provide more sophisticated results with faster speed. Hence in context with multi-relational data mining in which data is directly retrieved from different records without dumping into single table, we have described a novel approach of improved Multi-Relational Decision Tree Learning Algorithm based on the implementations. In this paper provided a comparative study of the aforementioned approach in which we have taken certain results from the literature review. Experiments mainly includes results from widely used datasets viz. Mutagenesis database which demonstrates that Multi-Relational Decision Tree Learning Algorithm provides a promising alternative from previous conventional approaches such as Progol, FOIL, and Tilde.

show abstract

Improved DYMO-Based ACO for MANET Using Distance and Density of Nodes

Kumar

Saini

Kumar

2019

Microservices in Big Data Analytics

View full text Add to dashboard Cite

An enhanced 4-way technique using cookies for robust authentication process in wireless network

Cited by 33 publications

References 4 publications

An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization

An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization

Design and Analysis of Hybrid Classification Approaches Across Multi-Relational Decision Tree Learning Algorithm

Improved DYMO-Based ACO for MANET Using Distance and Density of Nodes

Contact Info

Product

Resources

About