Time optimization encrypted queryretrieval par ali rasha (5 résultats)

Time Optimization of Encrypted QueryRetrieval for Intelligent Big Data
Ali, Rasha Subhi/ Abdul Majeed, Ghassan Hameed/ Farhan, Alaa Kadhim
- Couverture souple
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 118,78
EUR 11,84 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible
Paperback. Etat : Brand New. 176 pages. 8.66x5.91x0.40 inches. In Stock.

- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 64,90
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponibles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The rapid growth in the database data led to create of a large amount of data and the problem to access this data for answering user queries becomes more challenges.This work is concerned with problem of data retrieving from big encrypted database by proposing an approach consists(datamanagement, Encryption, DNA computing and Retrieval). The ICM algorithm and the three proposed clustering algorithm can be applied for big databases in both status (plain and encrypted) form.The second stage presents amodified CAST encryption algorithm to encrypt the database files (original or summarized).The S-Box that is used in the modified CAST algorithm is constructed by using an intelligent technique (DNA computing).Also, modified keys were used; the keys are generated by using AES generator with simple modification. After encryption process, the clusters can be built dynamicallyaccording to the user query byapplying suggested dynamic clustering algorithm which is used for both plain and encrypted data; this process provides time for the retrieval process because the files that are resulted from applying dynamic clustering algorithm include only relevant data to the user query. 176 pp. Englisch.…

Time Optimization of Encrypted QueryRetrieval for Intelligent Big Data
Rasha Subhi Ali|Ghassan Hameed Abdul Majeed|Alaa Kadhim Farhan
- Couverture souple
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 52,90
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ali Rasha SubhiRasha Subhi Ali is Doctor in computer science in University of Technology.Prof. Dr. Ghassan Hameed Abdul Majeed is Doctor in Petroleum Engineering in Ministry of Higher Education.Assist. Prof.Dr.Alaa Kadhim Farhan is D.…

- Couverture souple
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 72,42
EUR 35,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The rapid growth in the database data led to create of a large amount of data and the problem to access this data for answering user queries becomes more challenges.This work is concerned with problem of data retrieving from big encrypted database by proposing an approach consists(datamanagement, Encryption, DNA computing and Retrieval). The ICM algorithm and the three proposed clustering algorithm can be applied for big databases in both status (plain and encrypted) form.The second stage presents amodified CAST encryption algorithm to encrypt the database files (original or summarized).The S-Box that is used in the modified CAST algorithm is constructed by using an intelligent technique (DNA computing).Also, modified keys were used; the keys are generated by using AES generator with simple modification. After encryption process, the clusters can be built dynamicallyaccording to the user query byapplying suggested dynamic clustering algorithm which is used for both plain and encrypted data; this process provides time for the retrieval process because the files that are resulted from applying dynamic clustering algorithm include only relevant data to the user query.…

- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 64,90
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The rapid growth in the database data led to create of a large amount of data and the problem to access this data for answering user queries becomes more challenges.This work is concerned with problem of data retrieving from big encrypted database by proposing an approach consists(datamanagement, Encryption, DNA computing and Retrieval). The ICM algorithm and the three proposed clustering algorithm can be applied for big databases in both status (plain and encrypted) form.The second stage presents amodified CAST encryption algorithm to encrypt the database files (original or summarized).The S-Box that is used in the modified CAST algorithm is constructed by using an intelligent technique (DNA computing).Also, modified keys were used; the keys are generated by using AES generator with simple modification. After encryption process, the clusters can be built dynamicallyaccording to the user query byapplying suggested dynamic clustering algorithm which is used for both plain and encrypted data; this process provides time for the retrieval process because the files that are resulted from applying dynamic clustering algorithm include only relevant data to the user query.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 176 pp. Englisch.…