Semistructured Data

We present a Heterogenous Data Quality Methodology (HDQM) for Data Quality (DQ) assessment and improvement that considers all types of data managed in an organization, namely structured data represented in databases, semistructured data usually represented in XML, and unstructured data represented in documents. We also define a meta-model in order to describe the relevant knowledge managed in the methodology. The different types of data are translated in a common conceptual representation. We consider two dimensions widely analyzed in the specialist literature and used in practice: Accuracy and Currency. The methodology provides stakeholders involved in DQ management with a complete set of phases for data quality assessment and improvement. A non trivial case study from the business domain is used to illustrate and validate the methodology.

We posit that a semistructured data model offers the right balance of rich structure and flexible (or lack of) schema allowing naive end users to record information in whatever form makes it easy for them to manage. We describe our Haystack system, which exposes the richness and flexibility of the data model while offering the user natural, traditional interfaces that shield them from the specifics of schemas, tuples, and database queries. We outline research challenges that remain to be addressed.

The ISO 9001 standard is adopted worldwide by organizations from different sectors. The ISO 9001:2015 guidelines for implementing the process approach require not only the identification of the organization processes, but also the description of their interactions as a network system. Flow charts are a common tool adopted in quality management to show the sequence flow of a process. However, they do not show interrelations between different processes. The first aim of this study is to investigate the utilization of some software engineering models to satisfy the process approach requirement in the ISO 9001:2015 standard. The second aim is to show the implementation of the ISO 9001:2015 process approach and the "Plan-Do-Check-Act" (PDCA) cycle to manage academic programs processes as a case study and to present how the proposed models can be utilized to describe the interactions between processes. Finally, the study used a semi-structured interview methodology to evaluate the proposed models based on three criteria: understandability, modifiability and process improvement.

The International Journal of Software Engineering & Applications (IJSEA) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Software Engineering & Applications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts & establishing new collaborations in these areas.

We posit that a semistructured data model offers the right balance of rich structure and flexible (or lack of) schema allowing naive end users to record information in whatever form makes it easy for them to manage. We describe our Haystack system, which exposes the richness and flexibility of the data model while offering the user natural, traditional interfaces that shield them from the specifics of schemas, tuples, and database queries. We outline research challenges that remain to be addressed.

Planning for a Baby:  https://youtu.be/2iwLh6XCnq8

Pregnancy with IBD: https://youtu.be/br0kciD8xJk

Motherhood with IBD: https://youtu.be/TQjt8pnMv4I


Our aim is to provide an understanding of the experience of women with inflammatory bowel disease (IBD) who have made the transition to motherhood. A total of 22 mothers with IBD were recruited from around the United Kingdom. Semi-structured interviews were conducted and analyzed using thematic analysis. The central concept—Blurred Lines—offers a novel frame for understanding the transition to motherhood with IBD through identifying parallels between having IBD and becoming, and being, a mother. Parallels clustered into three main themes: Need for Readiness, Lifestyle Changes, and Monitoring Personal and Physical Development. Hence, women with IBD are in some ways well prepared for the challenges of motherhood even though, as a group, they tend to restrict their reproductive choices. We recommend health professionals initiate conversations about reproduction early and provide a multidisciplinary approach to pregnancy and IBD in which women have confidence that their ongoing treatment will be integrated successfully with their maternity care.

Because of the widespread diffusion of semistructured data in XML format, much research effort is currently devoted to support the storage and retrieval of large collections of such documents. XML documents can be compared as to their structural similarity, in order to group them into clusters so that different storage, retrieval, and processing techniques can be effectively exploited. In this scenario, an efficient and effective similarity function is the key of a successful data management process. We present an approach for detecting structural similarity between XML documents which significantly differs from standard methods based on graph-matching algorithms, and allows a significant reduction of the required computation costs. Our proposal roughly consists of linearizing the structure of each XML document, by representing it as a numerical sequence and, then, comparing such sequences through the analysis of their frequencies. First, some basic strategies for encoding a document are proposed, which can focus on diverse structural facets. Moreover, the theory of Discrete Fourier Transform is exploited to effectively and efficiently compare the encoded documents (i.e., signals) in the domain of frequencies. Experimental results reveal the effectiveness of the approach, also in comparison with standard methods.

We often use UML diagrams for our software development projects, and also for modeling XML DTDs and Schemas, finding that although UML diagrams can effectively be made to represent DTDs and Schemas (either using Class or Component diagrams), in real practice, complex DTDs and Schemas produce unreadable, unmanageable, complex UML diagrams. Recently we started exploring other types of diagrams and unconventional methods which can be both useful for designing and modeling semistructured data, and as teaching aids or thinking tools. This experience also served to open our minds to tools and methods other than the recognized mainstream practices.
In this paper, we describe how we managed to use Mind Maps and a modified Freemind tool to successfully model, design, modify, import and export XML DTDs, XML Schemas (XSD and RNG) and also XML document instances, getting very manageable, easily comprehensible, folding diagrams. In this way, we converted a general purpose mind-mapping tool, into a very powerful tool for XML vocabulary design and simplification (and also for teaching XML markup, or for presentation purposes).

We present a Heterogenous Data Quality Methodology (HDQM) for Data Quality (DQ) assessment and improvement that considers all types of data managed in an organization, namely structured data represented in databases, semistructured data usually represented in XML, and unstructured data represented in documents. We also define a meta-model in order to describe the relevant knowledge managed in the methodology. The different types of data are translated in a common conceptual representation. We consider two dimensions widely analyzed in the specialist literature and used in practice: Accuracy and Currency. The methodology provides stakeholders involved in DQ management with a complete set of phases for data quality assessment and improvement. A non trivial case study from the business domain is used to illustrate and validate the methodology.

A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notices, and advertisements (for business purposes and for easy user access). We call these blocks that are not the main content blocks of the page, the noisy blocks. We show that the information contained in these noisy blocks can seriously harm Web data mining. Eliminating these noises is thus of great importance. In this project, we propose a noise elimination technique that uses a machine learning (ML) based method which compares HTML tag pairs to estimate how likely they present in the web pages. We use one of the ML techniques called J48 decision tree classifier since decision tree decides the target value (dependent variable) of a new sample based on various attribute values of the available data.

Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI query language of the INEX benchmark series reflect the emerging interest in IR-style ranked retrieval over semistructured data. TopX is a top-k retrieval engine for text and semistructured data. It terminates query execution as soon as it can safely determine the k top-ranked result elements according to a monotonic score aggregation function with respect to a multidimensional query. It efficiently supports vague search on both content-and structure-oriented query conditions for dynamic query relaxation with controllable influence on the result ranking. The main contributions of this paper unfold into four main points: 1) fully implemented models and algorithms for ranked XML retrieval with XPath Full-Text functionality, 2) efficient and effective top-k query processing for semistructured data, 3) support for integrating thesauri and ontologies with statistically quantified relationships among concepts, leveraged for word-sense disambiguation and query expansion, and 4) a comprehensive description of the TopX system, with performance experiments on large-scale corpora like TREC Terabyte and INEX Wikipedia.

Existing systems for managing and querying semistructured-data sources store the schema with the data. Lorel QRS+95] and Tsimmis PGMW95] store their data as graphs. The schema is stored as attributes labeling the graph's edges. Strudel FFK+98] stores the data externally as ...

Many Web data sources and APIs make their data available in XML, JSON, or a domain-specific semi-structured format, with the goal of making the data easily accessible and usable by Web application developers. Although such data formats are more machine-processable than pure text documents, managing and analyzing such data in large scale is often nontrivial. This is mainly due to the lack of a well-defined (or understood) structure and clear semantics in such data formats, which could result in poor data quality. In the xCurator project, we add structure to such data with the goal of publishing it on the Web as Linked Data. We enhance the quality of such data by: extracting entities, their types, and their relationships to other entities; performing entity (and entity type) identification; merging duplicate entities (and entity types); linking related entities (internally and to external sources); and publishing the results on the Web as high-quality Linked Data. This is all in a light-weight easy-to-use and scalable framework that effectively incorporates user feedback in all phases. We describe the initial framework of our system and report the results of using our system for managing large volumes of (user-generated) data on the Web in several real world applications.

Những hệ thống quản trị dữ liệu có chức năng quản lý dữ liệu, trích những thông tin hữu ích từ dữ liệu và sử dụng những thông tin này nhằm hỗ trợ việc ra quyết định. Vì thế những hệ thống này bao gồm cả các hệ thống cơ sở dữ liệu, các kho dữ liệu và các hệ thống khai mỏ dữ liệu. Dữ liệu có thể thuộc dạng có cấu trúc như trong các cơ sở dữ liệu quan hệ, cũng có thể thuộc dạng bán cấu trúc hay dữ liệu XML, hoặc thậm chí là dạng không có cấu trúc như dữ liệu đa phương tiện. Hiện nay, những hệ thống quản trị dữ liệu là thành phần nòng cốt trong các hệ thống thông tin và các ứng dụng. Những hệ thống thông tin và ứng dụng này lại chính là những tài sản có giá trị nhất trong các cơ quan, doanh nghiệp. Những tiến bộ trong công nghệ Internet cùng với sự phát triển không ngừng của Web dẫn tới sự gia tăng liên tục về nhu cầu quản trị dữ liệu và thông tin. Chính điều này đã tạo nên sự cần thiết cấp bách trong việc bảo đảm an toàn cho các cơ sở dữ liệu, hệ thống thông tin và ứng dụng. Bài báo này trước hết sẽ điểm lại những vấn đề và giải pháp trong việc bảo mật của các cơ sở dữ liệu, sau đó sẽ giới thiệu những vấn đề và hướng nghiên cứu mới về bảo mật trong các hệ thống quản trị dữ liệu và ứng dụng hiện đại. Những vấn đề sẽ được thảo luận trong bài này là những vấn đề đang rất được quan tâm cả trong nghiên cứu và các ứng dụng thực tế.

Abstract. This paper presents structural recursion as the basis of the syntax and semantics of query languages for semistructured data and XML. We describe a simple and powerful query language based on pattern matching and show that it can be expressed using structural recursion, which is introduced as a top-down, recursive function, similar to the way XSL is defined on XML trees. On cyclic data, structural recursion can be defined in two equivalent ways: as a recursive function which evaluates the data top-down and remembers all its calls to avoid infinite loops, or as a bulk evaluation which processes the entire data in parallel using only traditional relational algebra operators. The latter makes it possible for optimization techniques in relational queries to be applied to structural recursion. We show that the composition of two structural recursion queries can be expressed as a single such query, and this is used as the basis of an optimization method for mediator systems. Several other formal properties are established: structural recursion can be expressed in first-order logic extended with transitive closure; its data complexity is PTIME; and over relational data it is a conservative extension of the relational calculus. The underlying data model is based on value equality, formally defined with bisimulation. Structural recursion is shown to be invariant with respect to value equality.

We posit that a semistructured data model offers the right balance of rich structure and flexible (or lack of) schema allowing naive end users to record information in whatever form makes it easy for them to manage. We describe our Haystack system, which exposes the richness and flexibility of the data model while offering the user natural, traditional interfaces that shield them from the specifics of schemas, tuples, and database queries. We outline research challenges that remain to be addressed.

Nowadays, data can be represented and stored by using different formats ranging from non structured data, typical of file systems, to semistructured data, typical of Web sources, to highly structured data, typical of relational database systems. Therefore, the necessity arises to define new models and approaches for uniformly handling datasources having different formats and structures, and obtaining a global, integrated, and uniform representation. In this paper we present three approaches to data integration and propose a unifying framework integrating the various methodologies and incorporating techniques developed separately. We also present the architecture of a metadata repository supporting the integration framework.

Semi-structured data has become prevalent with the growth of the Internet. The data is usually stored in a traditional database system or in a specialized repository. While many information providers have presented their databases on the web as semi-structured data, other information providers are developing repositories for new application. One such application is e-commerce, which is emerging as a major web-supported application assisting business transactions between multiple parties via the network and involving large amounts of data. Designing a \good" semi-structured database is increasingly crucial to prevent data redundancy, inconsistency and updating anomalies. In this paper, we propose a conceptual approach to design semi-structured databases. A conceptual layer which is based on the popular Entity-Relationship (ER) model is employed to remove anomalies and redundancies at the semantic level. An algorithm to map an ER diagram involving composite attributes weak entity types, recursive, n-ary and ISA relationship sets, and aggregations to a semi-structured schema graph (S3-Graph) used to represent semi-structured data is given. Our study reveals similarities between the S3-Graph and the hierarchical model and nested relations in that all have limitations in modeling situations with nonhierarchical relationships given their tree-like structures.

In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructured data and their temporal aspects. In particular, we focus on transaction time.

The diversity and availability of information sources on the World Wide Web has set the stage for integration and reuse at an unparalleled scale. There remain signi cant hurdles to exploiting the extent of the Web's resources in a consistent, scalable and maintainable fashion. The autonomy and volatility of Web sources complicates maintaining wrappers consistent with the requirements of the data's target application. Also, the sources' semantic heterogeneity requires practical methods to mediate their contents.

All query languages proposed for semistructured data share as common characteristic the ability to traverse arbitrary long path in the data in the form of regular path expressions. The expressive power of these languages lies in between that of the relational calculus, and that of query languages with recursion, like datalog. We consider the problems of query containment and query equivalence for a certain subset of the StruQL language implemented in the St r u d e lweb-site management system, consisting of conjunctive queries with regular expressions. It was previously known that contaiment and equivalence are NP-complete for the conjunctive fragment of the relational calculus, and undeciable for datalog. We s h o w that these problems are decidable for conjunctive queries with regular path expressions. Both are PSPACE hard: the complexity of our decision algorithm however is higher, leaving a gap between the lower and upper complexity bounds. For a restricted class of conjunctive queries with regular path exrepssions we s h o w that containment and equivalence are NP-complete. This o ers, to our knowledge, the rst example of a query language with recursion in which c o n tainment and equivalence have the same complexity as that of conjunctive queries in the relational calculus. the restructuring capabilities, the full StruQL language is more expressive than both UnQL and Lorel: however, we do not discuss the restructuring aspects in this paper. Furthermore, StruQL 0 is a subset of datalog with a limited yet interesting form of recursion. Importantly, the containment result for datalog do not yield any interesting results for StruQL 0 . In particular, StruQL 0 identi es a subset of datalog for which c o n tainment is decidable.

This work presents the query language TQL, a query language for semistructured data, that can be used to query XML files. TQL substitutes the standard path-based pattern-matching mechanism with a logic-based mechanism, where the programmer specifies the properties of the pieces of data she is trying to extract. As a result, TQL queries are more 'declarative', or less 'operational', than queries in comparable languages. This feature makes some queries easier to express, and should allow the adoption of better optimization techniques. Through a set of examples, we show that the range of queries that can be declaratively expressed in TQL is quite wide. The implementation of TQL binding mechanism requires the adoption of non-standard techniques, and some of its aspects are still open. In this paper we implicitly report about the current status of the implementation by writing all queries using the version of TQL that has been implemented, and that can be freely downloaded from //tql.di.unipi.it/tql.

Recent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression. Also, in semi-structured data, as well as in data integration, data warehousing, and query optimization, the problem of view-based query rewriting is receiving much attention: Given a query and a collection of views, generate a new query which uses the views and provides the answer to the original one.

In this paper we introduce the representative object, which uncovers the inherent schema(s) in semistructured, hierarchical data sources and provides a concise description of the structure of the data. Semistructured data, unlike data stored in typical relational or object-oriented databases, does not have fixed schema that is known in advance and stored separately from the data. With the rapid growth of the World Wide Web, semistructured hierarchical data sources are becoming widely available to the casual user. The lack of external schema information currently makes browsing and querying these data sources inefficient at best, and impossible at worst. We show how representative objects make schema discovery efficient and facilitate the generation of meaningful queries over the data.

The paper addresses the problem of integrating data based on a XML-like semistructured model with a data grid architecture based on an object-oriented model. This work is continuation of the previous works on object-to-relational wrappers and covers a generic integrationp rocedure for utilizing a native Lore query mechanism f or retrieving data from X ML data s ources. A corresponding wrapper is founded on the concepts of the stackbased approach (SBA) and updatable views. The p roposed architecture supports grid's transparency and allows a grid user to operate in an object-oriented environment through SBQL, a stackbased query language. The described wrapper makes it possible to employ the native Lorel query optimization mechanisms. A query entering the front-endo f the wrapper (object-oriented business model) is transformed and rewritten according to the SBQL optimization rules incorporated in the wrapper and then evaluated in t he native XML resource environment through the query language Lorel. The paper discusses architectural issues of such a wrapper and presents its idea through a concise example.

XML is emerging as the "universal" language for semistructured data description/exchange, and new issues regarding the management of XML data, both in terms of performance and usability, are becoming critical. The application of knowledge-based synthesization and compression methods (i.e. derivation of synthetic views and lossless/lossy approximation of contents) can be extremely beneficial in this scenario. In this paper we present SqueezeX, a system for the synthesization/compression of XML data based on a multidimensional/classification-based interpretation of their schema and on the application of semanticand type-oriented compression techniques.

We propose combining query approximation and query relaxation techniques in order to support flexible querying of heterogeneous data arising from lifelong learners' educational and work experiences. A key aim of such querying facilities is to allow learners to identify possible choices for their future learning and professional development from what others have done. With our approach, query results can be computed incrementally, in polynomial time, and returned in order of increasing "distance" from the user's original query.

Many Web data sources and APIs make their data available in XML, JSON, or a domain-specific semi-structured format, with the goal of making the data easily accessible and usable by Web application developers. Although such data formats are more machine-processable than pure text documents, managing and analyzing such data in large scale is often nontrivial. This is mainly due to the lack of a well-defined (or understood) structure and clear semantics in such data formats, which could result in poor data quality. In the xCurator project, we add structure to such data with the goal of publishing it on the Web as Linked Data. We enhance the quality of such data by: extracting entities, their types, and their relationships to other entities; performing entity (and entity type) identification; merging duplicate entities (and entity types); linking related entities (internally and to external sources); and publishing the results on the Web as high-quality Linked Data. This is all in a light-weight easy-to-use and scalable framework that effectively incorporates user feedback in all phases. We describe the initial framework of our system and report the results of using our system for managing large volumes of (user-generated) data on the Web in several real world applications.

We show how the mechanisms of an active/deductive object-oriented model are capable of modeling the information available on the World Wide Web, the paradigmatic example of a large, distributed collection of poorly structured, heterogeneous information, consisting of documents connected by hypertext links. We exhibit the basic features of the object model, including the schema de nition language, the query language with multiple roles, the basic update operations, and a form of active rules, and a compilation of the mentioned features into a fragment of LDL++, which is essentially Datalog extended with non-determinism and a form of strati ed negation. The proposed compilation has a twofold aim. On one side, it should provide an abstract implementation level, where the object model is declaratively reconstructed and its semantics clari ed. On the other side, the proposed compilation should form the basis of a realistic implementation, as LDL++ can be e ciently executed, and supports real side e ects.

We consider semistructured data as rooted edge-labeled directed graphs, and path inclusion constraints on these graphs. In this paper, we show that we can extract from a finite datum D a finite set C f (D) of word inclusions, which implies exactly every word inclusion satisfied by D. Then, we give a new decision algorithm for the implication problem of a constraint p q by a set of constraints pi ui where p, q, and the pi's are regular path expressions and the ui's are non empty paths, improving in this particular case, the more general algorithms of S. Abiteboul and V. Vianu, and Alechina et al. Moreover, in the case of a set of word equalities ui ≡ vi, we give a more efficient decision algorithm for the implication of a word equality u ≡ v, improving the more general algorithm of P. Buneman et al., and we prove that, in this case, the implication problem for non deterministic models or for (complete) deterministic models are equivalent.

Abstract: Semistructured databases require tailor-made concurrency control mechanisms since traditional solutions for the relational model have been shown to be inadequate. Such mechanisms need to take full advantage of the hierarchical structure of semistructured data, for instance allowing concurrent updates of subtrees of, or even individual elements in, XML documents. We present an approach for concurrency control which is document-independent in the sense that two schedules of semistructured transactions are ...

Abstract. Semistructured databases require tailor-made concurrency control mechanisms since traditional solutions for the relational model have been shown to be inadequate. Such mechanisms need to take full advantage of the hierarchical structure of semistructured data, for instance allowing concurrent updates of subtrees of, or even individual elements in XML documents. In earlier work, we presented two equivalent path locking schemes and two schedulers which guarantee serializability of schedules on XML documents. However, ...

Những hệ thống quản trị dữ liệu có chức năng quản lý dữ liệu, trích những thông tin hữu ích từ dữ liệu và sử dụng những thông tin này nhằm hỗ trợ việc ra quyết định. Vì thế những hệ thống này bao gồm cả các hệ thống cơ sở dữ liệu, các kho dữ liệu và các hệ thống khai mỏ dữ liệu. Dữ liệu có thể thuộc dạng có cấu trúc như trong các cơ sở dữ liệu quan hệ, cũng có thể thuộc dạng bán cấu trúc hay dữ liệu XML, hoặc thậm chí là dạng không có cấu trúc như dữ liệu đa phương tiện. Hiện nay, những hệ thống quản trị dữ liệu là thành phần nòng cốt trong các hệ thống thông tin và các ứng dụng. Những hệ thống thông tin và ứng dụng này lại chính là những tài sản có giá trị nhất trong các cơ quan, doanh nghiệp. Những tiến bộ trong công nghệ Internet cùng với sự phát triển không ngừng của Web dẫn tới sự gia tăng liên tục về nhu cầu quản trị dữ liệu và thông tin. Chính điều này đã tạo nên sự cần thiết cấp bách trong việc bảo đảm an toàn cho các cơ sở dữ liệu, hệ thống thông tin và ứng dụng. Bài báo này trước hết sẽ điểm lại những vấn đề và giải pháp trong việc bảo mật của các cơ sở dữ liệu, sau đó sẽ giới thiệu những vấn đề và hướng nghiên cứu mới về bảo mật trong các hệ thống quản trị dữ liệu và ứng dụng hiện đại. Những vấn đề sẽ được thảo luận trong bài này là những vấn đề đang rất được quan tâm cả trong nghiên cứu và các ứng dụng thực tế.

Những hệ thống quản trị dữ liệu có chức năng quản lý dữ liệu, trích những thông tin hữu ích từ dữ liệu và sử dụng những thông tin này nhằm hỗ trợ việc ra quyết định. Vì thế những hệ thống này bao gồm cả các hệ thống cơ sở dữ liệu, các kho dữ liệu và các hệ thống khai mỏ dữ liệu. Dữ liệu có thể thuộc dạng có cấu trúc như trong các cơ sở dữ liệu quan hệ, cũng có thể thuộc dạng bán cấu trúc hay dữ liệu XML, hoặc thậm chí là dạng không có cấu trúc như dữ liệu đa phương tiện. Hiện nay, những hệ thống quản trị dữ liệu là thành phần nòng cốt trong các hệ thống thông tin và các ứng dụng. Những hệ thống thông tin và ứng dụng này lại chính là những tài sản có giá trị nhất trong các cơ quan, doanh nghiệp. Những tiến bộ trong công nghệ Internet cùng với sự phát triển không ngừng của Web dẫn tới sự gia tăng liên tục về nhu cầu quản trị dữ liệu và thông tin. Chính điều này đã tạo nên sự cần thiết cấp bách trong việc bảo đảm an toàn cho các cơ sở dữ liệu, hệ thống thông tin và ứng dụng. Bài báo này trước hết sẽ điểm lại những vấn đề và giải pháp trong việc bảo mật của các cơ sở dữ liệu, sau đó sẽ giới thiệu những vấn đề và hướng nghiên cứu mới về bảo mật trong các hệ thống quản trị dữ liệu và ứng dụng hiện đại. Những vấn đề sẽ được thảo luận trong bài này là những vấn đề đang rất được quan tâm cả trong nghiên cứu và các ứng dụng thực tế.

Structured  data  is  easy  to  parse  and  process  using
simple software tools with effective results. However,
most  valuable  information  is  typically  found  in
unstructured  data.  The  problem  is  that  unstructured
data  is  significantly  harder  to  process,  especially  at
large scale. Adding some structure can greatly improve
data reuse. To demonstrate our approach, we focus on
one  particular  example,  namely  the  design  patterns,  a
common  encapsulation  mechanism,  widely  used  in
several domains to capture and reuse valuable domain
experiences.  Patterns are  growing  in  numbers  as  an
effective  way  of  communicating  knowledge  among
expert  designers.  Currently,  there  are numerous
domains  where  patterns  are  applied,  including HCI -Human  Computer  Interaction.  HCI  Patterns  are
typically published  in  books or on  the  Internet. The
sheer  number  of  HCI  patterns,  the  rich  and
heterogeneous  contents  coupled  with  the  lack  of  a
delivery  system  can  confuse  and  overwhelm  a  novice
pattern user, even when they are meant to help novice
users in the first place. We present an approach to add
structure to HCI patterns, hence providing the ability to
communicate  and  reuse  them  in  a  more  scalable  and
effective way.

Những hệ thống quản trị dữ liệu có chức năng quản lý dữ liệu, trích những thông tin hữu ích từ dữ liệu và sử dụng những thông tin này nhằm hỗ trợ việc ra quyết định. Vì thế những hệ thống này bao gồm cả các hệ thống cơ sở dữ liệu, các kho dữ liệu và các hệ thống khai mỏ dữ liệu. Dữ liệu có thể thuộc dạng có cấu trúc như trong các cơ sở dữ liệu quan hệ, cũng có thể thuộc dạng bán cấu trúc hay dữ liệu XML, hoặc thậm chí là dạng không có cấu trúc như dữ liệu đa phương tiện. Hiện nay, những hệ thống quản trị dữ liệu là thành phần nòng cốt trong các hệ thống thông tin và các ứng dụng. Những hệ thống thông tin và ứng dụng này lại chính là những tài sản có giá trị nhất trong các cơ quan, doanh nghiệp. Những tiến bộ trong công nghệ Internet cùng với sự phát triển không ngừng của Web dẫn tới sự gia tăng liên tục về nhu cầu quản trị dữ liệu và thông tin. Chính điều này đã tạo nên sự cần thiết cấp bách trong việc bảo đảm an toàn cho các cơ sở dữ liệu, hệ thống thông tin và ứng dụng. Bài báo này trước hết sẽ điểm lại những vấn đề và giải pháp trong việc bảo mật của các cơ sở dữ liệu, sau đó sẽ giới thiệu những vấn đề và hướng nghiên cứu mới về bảo mật trong các hệ thống quản trị dữ liệu và ứng dụng hiện đại. Những vấn đề sẽ được thảo luận trong bài này là những vấn đề đang rất được quan tâm cả trong nghiên cứu và các ứng dụng thực tế.

Những hệ thống quản trị dữ liệu có chức năng quản lý dữ liệu, trích những thông tin hữu ích từ dữ liệu và sử dụng những thông tin này nhằm hỗ trợ việc ra quyết định. Vì thế những hệ thống này bao gồm cả các hệ thống cơ sở dữ liệu, các kho dữ liệu và các hệ thống khai mỏ dữ liệu. Dữ liệu có thể thuộc dạng có cấu trúc như trong các cơ sở dữ liệu quan hệ, cũng có thể thuộc dạng bán cấu trúc hay dữ liệu XML, hoặc thậm chí là dạng không có cấu trúc như dữ liệu đa phương tiện. Hiện nay, những hệ thống quản trị dữ liệu là thành phần nòng cốt trong các hệ thống thông tin và các ứng dụng. Những hệ thống thông tin và ứng dụng này lại chính là những tài sản có giá trị nhất trong các cơ quan, doanh nghiệp. Những tiến bộ trong công nghệ Internet cùng với sự phát triển không ngừng của Web dẫn tới sự gia tăng liên tục về nhu cầu quản trị dữ liệu và thông tin. Chính điều này đã tạo nên sự cần thiết cấp bách trong việc bảo đảm an toàn cho các cơ sở dữ liệu, hệ thống thông tin và ứng dụng. Bài báo này trước hết sẽ điểm lại những vấn đề và giải pháp trong việc bảo mật của các cơ sở dữ liệu, sau đó sẽ giới thiệu những vấn đề và hướng nghiên cứu mới về bảo mật trong các hệ thống quản trị dữ liệu và ứng dụng hiện đại. Những vấn đề sẽ được thảo luận trong bài này là những vấn đề đang rất được quan tâm cả trong nghiên cứu và các ứng dụng thực tế.