Author of the publication

The Enhanced Greedy Interchange Algorithm for the Selection of Materialized Views Under a Maintenance Cost Constraint in Data Warehouses.

, , , and . ICEIS (1), page 279-284. (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Shuffled tree based fault-tolerant hierarchical interconnection networks., and . Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 251-265. DIMACS/AMS, (1994)Enhancement of Wavelet-Based Medical Image Retrieval Through Feature Evaluation Using an Information Gain Measure., , , and . SAC, page 220-226. ACM, (2003)Streaming real time data in data warehouses for just-intime views maintenance., , , and . IADIS AC (1), page 101-108. IADIS Press, (2009)Enhanced Semantic-based Chaotic System for Cyber-grooming Classification and Harassment Detection., , and . ICCA, page 1-10. IEEE, (2023)"TellMe": A Novel Protocol and Location Prediction Scheme Exploiting the Öne For All" Framework for Location Management., , , and . TIME, page 56-64. IEEE Computer Society, (2005)The Enhanced Greedy Interchange Algorithm for the Selection of Materialized Views Under a Maintenance Cost Constraint in Data Warehouses., , , and . ICEIS (1), page 279-284. (2003)Pruning Generalized Hypercube Interconnection Networks for Diameter Preservation: RedCube.. ICCA, page 364-368. IEEE, (2018)An optoelectronic expert system for knowledge base systems., and . ISDA, page 689-695. IEEE, (2010)Classification Rules for Pre-Analysis Filtering of Web Transactions., , and . AICCSA, page 764-770. IEEE Computer Society, (2006)Optical Hierarchical Fully Shuffled Tree., , , and . SAC (2), page 667-676. ACM, (2000)1-58113-240-9.