<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF13401</article-id><article-id pub-id-type="doi">10.3233/INF-2002-13401</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Data Aggregation Sets in Adaptive Data Model</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Adomėnas</surname><given-names>Petras Gailutis</given-names></name><email xlink:href="mailto:adomenas@fm.vtu.lt">adomenas@fm.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Čiučelis</surname><given-names>Algirdas</given-names></name><email xlink:href="mailto:fmf@fm.vtu.lt">fmf@fm.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Vilnius Gediminas Technical University, Saulėtekio 11, LT-2040 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2002</year></pub-date><volume>13</volume><issue>4</issue><fpage>381</fpage><lpage>392</lpage><history><date date-type="received"><day>01</day><month>01</month><year>2002</year></date></history><abstract><p>This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and order of laying out. As a result the data are aggregated to the structure needed for application problem algorithm. Data aggregation makes possible to adapt data structure presentation order and quantity for any application problem. Naturally, there must be enough necessary data in the relation sets for any application problem.</p></abstract><kwd-group><label>Keywords</label><kwd>input data</kwd><kwd>application problem</kwd><kwd>data sets</kwd><kwd>relation</kwd></kwd-group></article-meta></front></article>