<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Towards a General Entity Representation Model</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Barbara Bazzanella</string-name>
          <email>b.bazzanella@email.unitn.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Junaid Ahsenali Chaudhry</string-name>
          <email>chaudhry@disi.unitn.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Themis Palpanas</string-name>
          <email>themis@disi.unitn.eu</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Heiko Stoermer</string-name>
          <email>stoermer@disi.unitn.it</email>
        </contrib>
      </contrib-group>
      <abstract>
        <p>In recent years, there is an increasing interest in the Semantic Web and the relevant technologies, which can have a significant impact in the context of information and knowledge management. An important observation is that the entity identification problem lies at the core of many semantic web applications and the intrinsic difficulties of this problem have hindered progress in this area. In this paper, we argue for an infrastructure responsible for assigning and managing unique identifiers for entities in the semantic web, and we propose a conceptual model for the storage and management of these entities. The proposed model is generic and flexible and it allows for efficient and effective retrieval and analysis of the stored entities. We discuss the requirements with respect to creating and modifying these entities, as well as to managing their evolution over time. Finally, we study some enhancements of the entity representation, and we discuss the beneficial impact they can have on the performance of the system.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        One of the major problems that have emerged in the Semantic Web (SW) effort
is the problem of uniquely identifying entities1 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Entities play a major role
for the SW since they represent the atomic objects of reference and reasoning.
Nevertheless, we currently face the problem of identifying and referencing these
entities, since different users, or systems, assign different identifiers to the same
real-world entities. As a result, we cannot effectively reason about these entities,
exactly because they are not consistently being assigned the same identifier.
      </p>
      <p>The entity identification problem is also relevant to information and
knowledge management in an enterprise environment. Its successful solution can help
enterprises consolidate and integrate all the data about a single entity that are
scattered across data sources both inside and outside the boundaries of the
enterprise, thus, delivering significantly richer knowledge management opportunities.</p>
      <p>
        It has been argued that the entity identification problem is at the core of the
semantic web effort [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Along with the problem of assigning global identifiers to
entities in the semantic web also come the problems of managing these identifiers
1 In the rest of this paper, we will use the term entity to refer to individuals,
particulars, and instances, as opposed to classes or concepts.
throughout the entire lifetime of the entities. Giving efficient solutions to the
above issues is the goal of the OKKAM Entity Name System (ENS) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a
webscale system for assigning and managing unique, global identifiers to entities in
the WWW.
      </p>
      <p>In this study, we focus on the problem of how to efficiently and effectively
represent an entity in the context of such a system. We examine the requirements
of entity representation on the flexibility of the representation and the
functionality of the entire system, and we propose a conceptual model to this effect. We
also perform a systematic study about the description of entities, and propose
guidelines that can improve the representation and matching of entities through
the use of default (i.e., suggested) attributes. To the best of our knowledge, this
is the first comprehensive study in these directions.
1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Douglis et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] propose a storage infrastructure that effectively takes into
account not only disk read and writes, but also data creation and deletion.
Various techniques that employ different strategies have been proposed for efficiently
storing different versions of data objects [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. Versioning has also been studied
in the context of semi-structured documents [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and efficient query answering
algorithms have been proposed [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. When entities are created and modified,
we are interested in keeping track of information related to the provenance of
the entity data stored in the repository [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Efficient techniques for storing and
querying such metadata have been studied in the literature [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. Chapman
et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] propose efficient strategies for reducing the provenance storage size.
Several works have focused on the important problems of record linkage and
record matching [
        <xref ref-type="bibr" rid="ref12 ref13 ref14">12–14</xref>
        ]. Other studies have focused on the problem of how to
efficiently support the above operations in the context of relational database
systems [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ]. Duplicate detection through record linkage has also been studied
[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. These approaches are based on different flavors of clustering algorithms.
Benjelloun et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] propose three algorithms for solving the entity resolution
problem, namely, G-Swoosh, R-Swoosh, and F-Swoosh. These algorithms take
into account the characteristics of the match and merge functions, and can also
provide approximate results.
1.2
      </p>
    </sec>
    <sec id="sec-3">
      <title>Background</title>
      <p>
        We now give a brief overview of the ENS (a more detailed presentation can
be found elsewhere [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]), which we will use as the basis for our discussion. Note
however, that our discussion is relevant to any system for entity identification
management. The overall goal of the ENS is to handle the process of assigning
and managing unique identifiers for entities in the WWW. These identifiers are
global, with the purpose of consistently identifying a specific entity across system
boundaries, regardless of the place in which references to this entity may appear
(see Figure 1).
      </p>
      <p>The ENS has a repository for storing entity identifiers (note that this
repository will be distributed and replicated) along with some small amount of
descriptive information for each entity. The purpose of storing this information is
to use it for discriminating among entities, not exhaustively describing them.
Entities are described by a number of attribute-value pairs, where the attribute
names and the potential values are user-defined (arbitrary) strings, as we will
discuss in more detail in Section 2.1.</p>
      <p>Clients interact with the system through the Access Services layer. Clients
can be both human users and applications, and may inquire about the identifier
of an entity by providing a set of attributes that describes this entity. If the entity
exists in the repository, the system returns its identifier. Clients may also modify
the state of the repository, either by inserting a new entity in the system, in which
case the ENS returns the newly assigned identifier, or by changing some of the
attributes of an existing entity. As shown in Figure 1, the end result is that all
instances of the same entity (i.e., mentioned in different systems, ontologies, web
pages, etc.) are assigned the same identifier. Therefore, joining these documents
and merging their information becomes a much more simple and effective process
than before.
2</p>
      <sec id="sec-3-1">
        <title>Entity Representation</title>
        <p>In this section we discuss the requirements and the design of the entity
representation model for the ENS.</p>
        <p>The most important requirement is that we design an entity representation
conceptual model that takes into account the need for flexibility and generality
in the description of entities. Note that there is no fixed schema for the
representation of entities, which is essential for ensuring that the ENS can represent
arbitrary entities, and also for enabling easy access methods to clients that are
oblivious about the specific entity representation choices.</p>
        <p>Evidently, entities may change as a function of time. The description of these
entities in the ENS repository should be able to follow this natural evolution, by
modifying, adding, and deleting attributes. Similarly to the entities themselves,
the entire repository may evolve over time. In this case, we need to address the
issues of entity merges and splits. Two entities may merge if we discover that
they refer to the same real world entity. A split may occur if we discover that a
single entity refers to two real world entities.</p>
        <p>When entities are created and modified, we are interested in keeping track
of the information related to the provenance of the entity data stored in the
repository. The above information can potentially be useful for other algorithms
operating on the entities in the repository, such as matching and merging.</p>
        <p>
          Various techniques and algorithms are needed in order to analyze and mine
the wealth of information that can be gathered by observing the behavior of
the ENS, and assist in automating the evolution functions discussed above. This
information may come from observing the access and usage patterns of clients
as they interact with the ENS and explore the entities stored in the repository.
Given the amount of information and the real time requirements in the context
of the ENS, these analysis algorithms should be able to operate in an online
fashion, be flexible enough to allow effective and efficient data analysis of the
incoming data streams [
          <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
          ], and evolve over time by supporting time-decaying
representations of the streaming data [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ].
2.1
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Entity Representation Conceptual Model</title>
      <p>Based on the above requirements, we now present in detail the conceptual model
for entity representation in the ENS.</p>
      <p>In the ENS, we represent an entity E as a tuple E =&lt; oid, EQoid, Aid, prid,
D, M E &gt;, with the following information.
- An entity identifier, oid, assigned by the system.
- A set of equivalent ENS entity identifiers, EQoid. This field is used in the
case where we discover that two (or more) different entities in the ENS refer to
the same real world entity. By listing the other ENS identifiers in this field, we
establish an identity connection among the corresponding entities.
- A set of alternative ids, Aid. These are identifiers that other systems (external
to the ENS ) have assigned to the same entity. By listing these identifiers in this
field, we establish an identity connection among these identifiers.
- A preferred id, prid. This is the identifier that the entity prefers to be known
by, and this is the identifier that the ENS will return in response to an id query
about the entity. The default value for this field is the ENS identifier, oid.
- A description of the entity, D, which we discuss in more detail below.
-mMeteatdaadtaatafofrorthteheenetnittiyt,yi,nMcluEd=in&lt;gMcrGEea,MtioSEn, MtimPEeM.MAE &gt;SE. iMstGEheresptarteissetnictasltmheegtaednaertaa,l
including last modification time, number of times the entity was matched,
number of times it was selected, and last time it was selected. MPE is the provenance
metadata for the entity, that is, the source of information (where we found this
piece of information), and the agent that produced these data (name of software,
manual process, etc.). Finally, MAE is the access control metadata for the entity.</p>
      <p>We now move to D=&lt;t,A,R&gt;, which contains all the information that
describes the entity:
- The semantic type of the entity, t.
- The set of attributes describing the characteristics of the entity, A.
- The set of external references that refer to this entity, R.</p>
      <p>We should note that the semantic type field, t, can be very useful for
entity matching, since it provides some additional information for classifying and
identifying the entity. At the same time though, our goal is to keep the entity
representation model as simple and general as possible, which means that this
field should not take values from the domain of a fully-fledged semantic ontology
(note that in that case, we would have to maintain the ontology itself, too!). We
describe a viable and effective approach for this problem in Section 3. We also
take into account the fact that attribute names are arbitrary (since they are
user-defined), and extend our approach to address this issue as well. In the next
paragraphs, we discuss in more detail the attribute and reference fields of D.</p>
      <p>An attribute, A, is a tuple of the form A = &lt;n, v, veid, MA&gt;, containing the
following information: the name of the attribute, n, the value of the attribute,
v, the entity identifier assigned by the ENS for the entity described by v, veid,
and the metadata for attribute A, M A. M A=&lt;MGA,MSA,MPAMAA&gt; refers to the
metadata of the specific attribute A of a specific entity E. The tuple MGA is
the general metadata for the attribute, including creation time, and natural
language of the name/value pair. MSA is the statistical metadata for the attribute,
including last modification time, number of times the attribute was used in a
query, and the last time it was used in a query. MPA is the provenance metadata
for the attribute that includes the source of information, and the agent that
produced these data. MAA is the access control metadata for the attribute.</p>
      <p>A reference R is a tuple of the form R = &lt;c, p, M R &gt;, containing the
following information: the category of reference (e.g., ontology), the URL pointing
to the external reference, and the metadata for the reference, M R.
M R=&lt;MGR,MSR,MPRMAR&gt; refers to the metadata of a specific reference R of a
specific entity E. These metadata are as follows. MGR is the general metadata
for the reference that includes the creation time. MSR is the statistical metadata
for the reference, including the last time the reference was checked (i.e., latest
time we know this reference was valid). MPR is the provenance metadata for the
reference that includes the source of information, and the agent that produced
these data. Finally, MAR is the access control metadata for the reference.</p>
      <p>Before we conclude the discussion of the entity representation model, we
would like to emphasize the significance of the metadata. These metadata can
play an important role in query answering and ranking, as well as in the
management and evolution of the entity repository over time. For example, assigning
weights to attributes according to the provenance and statistical metadata can
help improve the performance of entity matching. Moreover, the information
on usage patterns that can be derived from the statistical metadata can drive
automatic algorithms for the self-management and evolution of the repository.
3</p>
      <p>Defining Default Attributes: a Bottom-Up Approach
Although in the ENS there is no fixed schema of entity types and attributes
to be used for describing entities, we aim to encourage some homogeneity in
the description of entity profiles. For this purpose we attempt to encourage the
clustering of entities into a small set of types and provide suggestions for the
corresponding descriptions by means of a default set of attributes for each
entity type. By following this approach we hope to improve the functionality of
the system in at least three different levels. First, having information about the
types of entity can be useful to guide the selection of specialized entity matching
algorithms. Second, the matching techniques can be considerably simplified and
improved. Last, the efficiency of the matching process can be improved, by
clustering attributes that convey overlapping information and reducing the number
of attributes to consider. In order to derive such a default schema we decided to
adopt a bottom-up approach, performing an experiment as follows.</p>
      <p>
        Selection of Top Level Categories: The first step in the experiment was
to select an appropriate collection of top-level categories. In order to obtain a
reasonably exhaustive, but at the same time limited, set of categories we adopted
a top-down approach. We analyzed the main top-level ontologies available in
literature (Wordnet [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], Dolce [
        <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
        ], Sumo [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], Cyc [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]) to integrate
important ontological distinctions from these ontologies. The goal was to identify a
set of few categories to use as a test-bed on which to perform the experimental
investigation. A detailed analysis of the procedure is reported in [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. At the
end of our analysis we identified the following six top-level categories: Person,
Organization, Event, Artifact, Location, and Other 2.
      </p>
      <p>Methodology: After establishing the top level categories for our study, we
conducted a user-study. Our aim was to investigate which attributes are more
frequently reported by people when describing the selected entity types, and to
derive lists of default attributes for those entity types.</p>
      <p>
        In order to get subjects to generate a set of representative attributes, we
adopted the feature-listing task paradigm [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. Following this paradigm, we asked
subjects to produce lists of attributes they think relevant to identify uniquely
members of our categories. Since our top level categories were at a high level of
abstraction, we decided to introduce a certain number of subcategories for each
of them in addition to the simple top-level category (named “neutral category”).
By means of this expedient we could identify a core set of attributes shared by
the different subcategories within the same top-level category. In Table 1 we
report the lists of subcategories used in the experiment.
2 We point out that the last category, Other, is a miscellaneous category that contains
all entities that are not classifiable in one of the other categories.
      </p>
      <p>Person Organization Event Artifact Location
politician company conference product tourist location
manager association meeting artwork city
professor university exhibition building shop
sports person government show book hotel
actor agency accident article of clothing restaurant
person organization event object location</p>
      <p>sports event</p>
      <p>Implementation and Subjects: The experiment was conducted with a
between-subjects design. That is, each subject was randomly assigned to only
one combination of 5 scenarios (one subcategory for each top level category).
This was required so as to eliminate interference between different scenarios. The
experiment was conducted through the web in three different versions: English
(eng), Italian (it), and Chinese (chi). We collected data from 358 participants
(159 for the English version, 194 for the Italian version and 5 for the Chinese
version3).</p>
      <p>Normalization: The linguistic nature of the task was bound to account
for a certain degree of variability in our data. To deal with this variability we
normalized the data with a semi-automatic procedure, converting the entries
of our database in a standard form. After having removed all typing errors,
we reported the attributes in a unique morphological form, removing articles,
normalizing the use of prepositions and the singular-plural inflections, as well
as fixing the order for composed attributes. Finally we aggregated attributes
characterized by semantic overlaps (such as synonyms).</p>
      <p>Measures and Results: The problem of suggesting descriptions for types
of entities at a high level of abstraction corresponds to identifying a set of general
attributes used by subjects across the subcategories of the same top-level
category. When aggregating the data from these subcategories, we require a measure
to evaluate the importance of an attribute f for the top-level category c.</p>
      <p>The first measure that we examined was the dominance measure, that can
be formalized as a function φ: C × F → N :</p>
      <p>dominance = φ(c, f ) = |{s ∈ S : f ∈ Fsc}|
where S is the sample of subjects, and Fsc is the set of attributes listed by the
subject s given the category c. In other words, the dominance φ of the attribute
f for the category c corresponds to the number of subjects that reported the
attribute f for the category c.</p>
      <p>Note that the dominance measure does not guarantee that in the first
positions of the ranked list (in descending order of dominant attributes) appear
attributes shared between the subcategories, because we have aggregated the
data from the subcategories. If an attribute is reported by all participants for
3 Because of the limited number of participants in the Chinese version, we present the
results only of the Italian and English versions.
a specific subcategory (e.g., “political party” for politician) and only for this
subcategory, it is possible that this attribute appears among the first attributes
for the corresponding top level category (e.g., Person). In order to derive a set of
default attributes that are both frequently reported by subjects for a specific
toplevel category, and also highly shared across the subcategories within the same
top-level category, we used a second measure, local sharedness, that quantifies
the level of sharing of an attribute f across a collection of subcategories:
sharednessloc = ψl(f ) =
|S[f ]|
|Sc|
where |S[f ]| is the collection of the subcategories that have in common the
attribute f , and |Sc| is the collection of all subcategories belonging to the category
c. Weighting the measure of dominance by local sharedness, φw = ψl ∗ φ, we
obtained the list of default attributes for our top-level categories. The complete
list of these attributes is reported in Table 2.
3.1</p>
    </sec>
    <sec id="sec-5">
      <title>Applications of Default Attributes Analysis</title>
      <p>We now sketch two possible uses of the default attributes reported in Table 2,
which demonstrate the importance of the above analysis.</p>
      <p>One possible application is the suggestion of a default schema for adding
new entities in the system. Client applications can be designed to give the user a
selection of our top-level categories, in order to get the class of the new entity to
be added. After the user has selected the entity type, the system can propose the
list of default attributes that our analysis found to be the most representative
for the specific entity type. At this point, the user can fill-in the values for these
attributes (or for some of them, or even insert new attributes) to describe the
entity to be created. The result is a relatively uniform representation for these
entity types, which can prove very beneficial for the entity matching process.</p>
      <p>A second application is entity disambiguation. When a new entity is added
to the repository, it is necessary to verify if it is already stored in the system. If
the entity type of the new entity is not known, our analysis can help improve the
performance of the entity disambiguation algorithms. For example, our analysis
showed that the attribute “surname” is one of the most important attributes to
describe a Person. If we identify that such an attribute is present in the new
entity description, then entity matching can be limited to (or start from) entities
of the entity type Person.
4</p>
      <sec id="sec-5-1">
        <title>Conclusions and Future Work</title>
        <p>In this paper, we argue for an entity naming system, where unique identifiers
for entities are assigned and managed. We examine the special requirements of
representing entities in such a system, propose a model for entity representation,
as well as a technique for enhancing its quality, and describe how the proposed
approach can help achieve the overall goals.
Attributes
name
age
gender
birth-date
surname
education
country
Organization name
location
country
address
type
size</p>
        <p>Web site url
Event
Artifact
Location
location
date
time
name
participants
type
duration
color/s
name
size
type
price
material
shape
name
country
location
address
geo coordinates
city
price
suggested default attributes. In our analysis, we decided to reduce as much as
possible the semantic aggregation of attributes. However, we still need to limit
the overlap of attributes. To this effect, we plan to perform a post-processing
analysis. One idea is to follow a simple criterion for aggregating attributes: when
two (or more) attributes share partial content, the attribute that conveys more
information will incorporate the other(s). For example, the attribute “age” is
subsumed by the attribute “birth-date”, and can therefore be incorporated into
the “birth-date”.</p>
        <p>Second, to investigate the impact of the proposed approach on the quality
of the system, for example, in terms of precision in entity matching. We are
currently in the process of conducting large-scale experiments in order to test
the behavior and performance of our solution.</p>
        <p>Acknowledgments This work was partially supported by the FP7 EU
Largescale Integrating Project OKKAM - Enabling a Web of Entities (contract no.
ICT-215032). For more details, visit http://www.okkam.org.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bouquet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoermer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bazzanella</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>An entity name system (ens) for the semantic web</article-title>
          .
          <source>In: ESWC</source>
          . (
          <year>2008</year>
          )
          <fpage>258</fpage>
          -
          <lpage>272</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Bouquet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoermer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Niederee</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mana</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Entity Name System: The Backbone of an Open and Scalable Web of Data</article-title>
          .
          <source>In: ICSC 2008. Number CSS-ICSC 2008-4-28-25</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Douglis</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Richards</surname>
            ,
            <given-names>E.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tetzlaff</surname>
            ,
            <given-names>W.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tracey</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
          </string-name>
          , J.:
          <article-title>Position: short object lifetimes require a delete-optimized storage system</article-title>
          .
          <source>In: ACM SIGOPS European Workshop</source>
          . (
          <year>2004</year>
          )
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Santry</surname>
            ,
            <given-names>D.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feeley</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hutchinson</surname>
            ,
            <given-names>N.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veitch</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carton</surname>
            ,
            <given-names>R.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ofir</surname>
          </string-name>
          , J.:
          <article-title>Deciding when to forget in the elephant file system</article-title>
          .
          <source>In: SOSP</source>
          . (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Mahalingam</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Towards a semantic, deep archival file system</article-title>
          .
          <source>In: FTDCS</source>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Chien</surname>
            ,
            <given-names>S.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsotras</surname>
            ,
            <given-names>V.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaniolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Efficient schemes for managing multiversionxml documents</article-title>
          .
          <source>VLDB J</source>
          .
          <volume>11</volume>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Chien</surname>
            ,
            <given-names>S.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsotras</surname>
            ,
            <given-names>V.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaniolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , D.:
          <article-title>Supporting complex queries on multiversion xml documents</article-title>
          .
          <source>ACM Trans. Internet Techn</source>
          .
          <volume>6</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>W.C.</given-names>
          </string-name>
          :
          <article-title>Provenance in databases: Past, current, and future</article-title>
          .
          <source>IEEE Data Eng. Bull</source>
          .
          <volume>30</volume>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Velegrakis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mylopoulos</surname>
          </string-name>
          , J.:
          <article-title>Representing and querying data transformations</article-title>
          .
          <source>In: ICDE</source>
          . (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velegrakis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Intensional associations between data and metadata</article-title>
          . In: SIGMOD. (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jagadish</surname>
            ,
            <given-names>H.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramanan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Efficient provenance storage</article-title>
          .
          <source>In: SIGMOD</source>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Elmagarmid</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ipeirotis</surname>
            ,
            <given-names>P.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verykios</surname>
            ,
            <given-names>V.S.:</given-names>
          </string-name>
          <article-title>Duplicate record detection: A survey</article-title>
          .
          <source>TKDE</source>
          <volume>19</volume>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Sarawagi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhamidipaty</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Interactive deduplication using active learning</article-title>
          .
          <source>In: KDD</source>
          . (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Galhardas</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Florescu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shasha</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simon</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saita</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          :
          <article-title>Declarative data cleaning: Language, model, and algorithms</article-title>
          . In: VLDB. (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Koudas</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marathe</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Flexible string matching against large databases in practice</article-title>
          .
          <source>In: VLDB</source>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Guha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koudas</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marathe</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Merging the results of approximate match operations</article-title>
          .
          <source>In: VLDB</source>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Halevy</surname>
            ,
            <given-names>A.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madhavan</surname>
          </string-name>
          , J.:
          <article-title>Reference reconciliation in complex information spaces</article-title>
          .
          <source>In: SIGMOD</source>
          . (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Benjelloun</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Molina</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Menestrina</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Whang</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Widom</surname>
          </string-name>
          , J.:
          <article-title>Swoosh: a generic approach to entity resolution</article-title>
          .
          <source>VLDB J. accepted for publication</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Palpanas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalogeraki</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gunopulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Online distribution estimation for streaming data: Framework and applications</article-title>
          . In: SEBD. (
          <year>2007</year>
          )
          <fpage>430</fpage>
          -
          <lpage>438</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Tantono</surname>
            ,
            <given-names>F.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manerikar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palpanas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Efficiently discovering recent frequent items in data streams</article-title>
          .
          <source>In: SSDBM</source>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Palpanas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vlachos</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keogh</surname>
            ,
            <given-names>E.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gunopulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Streaming time series summarization using user-defined amnesic functions</article-title>
          .
          <source>TKDE</source>
          <volume>20</volume>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Oltramari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gangemi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guarino</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Restructuring wordnet's top-level: The ontoclean approach</article-title>
          . In: OntoLex. (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Gangemi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guarino</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oltramari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Sweetening ontologies with dolce</article-title>
          .
          <source>In: EKOW</source>
          . Volume
          <volume>2473</volume>
          . (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Masolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , andA. Gangemi,
          <string-name>
            <given-names>S.B.</given-names>
            ,
            <surname>Guarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Oltramari</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>WonderWeb Deliverable D18 Ontology Library (final</article-title>
          ).
          <source>(</source>
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Niles</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pease</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Towards a standard upper ontology</article-title>
          .
          <source>In: FOIS</source>
          . (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Matuszek</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabral</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Witbrock</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>DeOliveira</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An introduction to the syntax and content of cyc</article-title>
          . In: AAAI Spring Symposium on Formalizing and
          <article-title>Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering</article-title>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Bazzanella</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoermer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bouquet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Top Level Categories and Attributes for Entity Representation</article-title>
          .
          <source>Technical Report 1</source>
          , University of Trento (
          <year>2008</year>
          ) http://eprints.biblio.unitn. it/archive/00001467/.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>McRae</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cree</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seidenberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McNorgan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Semantic feature production norms for a large set of living and nonliving things</article-title>
          .
          <source>Behavior Research Methods, Instrument and Computers</source>
          <volume>37</volume>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>