INFORMATION SYSTEMS CAN BE COMPARED WITH THE MANUFACTURING SYSTEMS IN THE SENSE THAT THE LATTER PRODUCE PHYSICAL PRODUCTS FROM RAW MATERIALS AND THE FIRST GENERATE INFORMATION PRODUCTS FROM RAW DATA. THIS ANALOGY EMPHASIZES THE IDEA THAT PRODUCTS, WHETHER PHYSICAL OR INFORMATION, HAVE A VALUE THAT IS TRANSFERABLE TO THE CONSUMER. IF WE SEE AN INFORMATION SYSTEM AS A SYSTEM WHOSE PURPOSE IS TO DELIVER PRODUCTS OF HIGH QUALITY INFORMATION, THEN THE DATA QUALITY OR INFORMATION QUALITY IS AN IMPORTANT FACTOR TO CONSIDER IN ITS PRODUCTION. INDEED, THE DATA QUALITY IS OFTEN DEFINED AS """"""""DATA SUITABLE FOR USE"""""""", I.E., DATA THAT ARE USEFUL FOR CONSUMERS/USERS IN A SPECIFIED CONTEXT OF USE. CONSIDERING THE ABOVE, THIS RESEARCH FOCUSES ON THE IDEA THAT THE QUALITY OF DATA MUST BE ADDRESSED FROM THE BEGINNING OF THE DEVELOPMENT OF AN INFORMATION PRODUCT, I.E., FROM WHEN CREATING THE INFORMATION SYSTEM THAT WILL GENERATE. THUS, THIS PAPER PRESENTS A METHOD THAT LEADS TO A DEVELOPMENT TEAM TO BUILD INFORMATION SYSTEMS FOCUSING ON DATA QUALITY. SPECIFICALLY, THE FIRST VERSION OF THIS METHOD, AIMED AT THE REQUIREMENTS SPECIFICATION STAGE OF AN INFORMATION SYSTEM WITH DATA QUALITY. A CASE STUDY SHOWING HOW THE METHOD HAS BEEN APPLIED IN THE DEVELOPMENT OF AN INFORMATION SYSTEM IS PRESENTED.

LET BE A SET OF POINTS LOCATED IN A RECTANGLE AND IS A POINT THAT IS NOT IN . THIS ARTICLE DESCRIBES THE DESIGN, IMPLEMENTATION, AND EXPERIMENTATION OF DIFFERENT ALGORITHMS TO SOLVE THE FOLLOWING TWO PROBLEMS: (I) MAXIMUM EMPTY RECTANGLE (MER), WHICH CONSISTS IN FINDING AN EMPTY RECTANGLE WITH A MAXIMUM AREA CONTAINED IN R AND DOES NOT CONTAIN ANY POINT FROM AND (II) QUERY MAXIMUM EMPTY RECTANGLE (QMER), WHICH CONSISTS IN FINDING THE RECTANGLE WITH THE SAME RESTRICTIONS GIVEN FOR THE MER PROBLEM BUT MUST ALSO CONTAIN . IT IS ASSUMED THAT BOTH PROBLEMS HAVE INSUFFICIENT MAIN MEMORY TO STORE ALL THE OBJECTS IN SET . ACCORDING TO THE LITERATURE, BOTH PROBLEMS ARE VERY PRACTICAL IN FIELDS SUCH AS DATA MINING AND GEOGRAPHIC INFORMATION SYSTEMS (GIS). SPECIFICALLY, THE PRESENT STUDY PROPOSES TWO ALGORITHMS THAT ASSUME THAT IS STORED IN SECONDARY MEMORY (MAINLY DISK) AND THAT IT IS IMPOSSIBLE TO STORE IT COMPLETELY IN MAIN MEMORY. THE FIRST ALGORITHM SOLVES THE QMER PROBLEM AND CONSISTS OF DECREASING THE SIZE OF S BY USING DOMINANCE AREAS AND THEN PROCESSING THE POINTS THAT ARE NOT ELIMINATED USING AN ALGORITHM PROPOSED BY ORLOWSKI (1990). THE SECOND ALGORITHM SOLVES THE MER PROBLEM AND CONSISTS OF DIVIDING R INTO FOUR SUBRECTANGLES THAT GENERATE FOUR SUBSETS OF SIMILAR SIZE; THESE ARE PROCESSED USING AN ALGORITHM PROPOSED IN EDMONS ET AL. (2003), AND FINALLY THE PARTIAL SOLUTIONS ARE COMBINED TO OBTAIN A GLOBAL SOLUTION. FOR THE PURPOSE OF VERIFYING ALGORITHM EFFICIENCY, RESULTS ARE SHOWN FOR A SERIES OF EXPERIMENTS THAT CONSIDER SYNTHETIC AND REAL DATA.