Results 1 - 10 of 1,415

Semantic Based XML Context Driven Search And Retrieval

by Vedula Venkateswara Rao
"... we present in this paper, a context-driven search engine called XCD Search for answering XML Keyword-based queries as well as Loosely Structured queries, using a stack-based sort-merge algorithm. Most current research is focused on building relationships between data elements based solely on their l ..."
Abstract - Add to MetaCart
we present in this paper, a context-driven search engine called XCD Search for answering XML Keyword-based queries as well as Loosely Structured queries, using a stack-based sort-merge algorithm. Most current research is focused on building relationships between data elements based solely

Generic Schema Matching with Cupid

by Jayant Madhavan, Philip Bernstein, Erhard Rahm - In The VLDB Journal , 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract - Cited by 604 (17 self) - Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past

TIMBER: A Native XML Database

by H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman, Laks V. S. Lakshmanan, Andrew Nierman, Stelios Paparizos, Jignesh M. Patel, Divesh Srivastava, Nuwee Wiwatwattana, Yuqing Wu, Cong Yu - THE VLDB JOURNAL , 2002
"... This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for manipulating trees, and natively stores XML. New access methods have been developed to evaluate queries in ..."
Abstract - Cited by 142 (14 self) - Add to MetaCart
in the XML context, and new cost estimation and query optimization techniques have also been developed. We present performance numbers to support some of our design decisions. We believe that the key intellectual contribution of this system is a comprehensive set-at-a-time query processing ability in a

Detecting Changes in XML Documents

by Gregory Cobena, Serge Abiteboul, Amelie Marian - In ICDE , 2001
"... We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses capable of storing massive volume of XML data. Because of the context, our algorithm has to be very efficient in terms of s ..."
Abstract - Cited by 159 (3 self) - Add to MetaCart
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses capable of storing massive volume of XML data. Because of the context, our algorithm has to be very efficient in terms

Accelerating XPath location steps

by Torsten Grust - ACM SIGMOD Int. Conference on Management of Data , 2002
"... This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all XPath axes (including ancestor, following, precedingsibling, descendant-or-self, etc.). This feature lets the index stan ..."
Abstract - Cited by 261 (18 self) - Add to MetaCart
stand out among related work on XML indexing structures which had a focus on regular path expressions (which correspond to the XPath axes children and descendantor-self plus name tests). Its ability to start traversals from arbitrary context nodes in an XML document additionally enables the index

Labeling Dynamic XML Trees

by Edith Cohen , Haim Kaplan, Tova Milo , 2002
"... We present algorithms to label the nodes of an XML tree which is subject to insertions and deletions of nodes. The labeling is done such that (1) we label each node immediately when it is inserted and this label remains unchanged, and (2) from a pair of labels alone, we can decide whether one node ..."
Abstract - Cited by 120 (2 self) - Add to MetaCart
node is an ancestor of the other. This problem arises in the context of XML databases that support queries on the structure of the documents as well as on the changes made to the documents over time. We prove that our algorithms assign the shortest possible labels (up to a constant factor) which

DTD Inference for Views of XML Data

by Yannis Papakonstantinou, Victor Vianu , 1999
"... We study the inference of Data Type Definitions (DTDs) for views of XML data, using an abstraction that focuses on document content structure. The views are defined by a query language that produces a list of documents selected from one or more input sources. The selection conditions involve vertica ..."
Abstract - Cited by 130 (13 self) - Add to MetaCart
We study the inference of Data Type Definitions (DTDs) for views of XML data, using an abstraction that focuses on document content structure. The views are defined by a query language that produces a list of documents selected from one or more input sources. The selection conditions involve

Context Sequence Matching for XML

by Temur Kutsia , 2005
"... Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language to query and transform XML, or to specify and verify web sites. Such a language would have advantages of b ..."
Abstract - Cited by 10 (5 self) - Add to MetaCart
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language to query and transform XML, or to specify and verify web sites. Such a language would have advantages

RQL: A Declarative Query Language for RDF

by Greg Karvounarakis, Sofia Alexaki, Vassilis Christophides, Dimitris Plexousakis, Michel Scholl
"... Real-scale Semantic Web applications, such as Web Portals and E-Marketplaces, require the management of voluminous metadata repositories containing descriptive information (i.e., metadata) about the available Web resources and services. Better knowledge about the meaning, usage, accessibility or qua ..."
Abstract - Cited by 247 (27 self) - Add to MetaCart
or quality of these resources and services will considerably facilitate the automated processing of both Web content and services. In this context, the Resource Description Framework (RDF) enables the creation and exchange of metadata as any other Web data. Although large volumes of RDF descriptions

R.: IntAct: an open source molecular interaction database. Nucleic Acids Res., (2004) 32 Database issue D452-D455

by Henning Hermjakob, Luisa Montecchi-palazzi, Chris Lewington, Sugath Mudali, Samuel Kerrien, Ra Orchard, Martin Vingron, Bernd Roechert, Peter Roepstorff, Alfonso Valencia, Hanah Margalit, John Armstrong, Amos Bairoch, Gianni Cesareni, David Sherman, Rolf Apweiler
"... IntAct provides an open source database and toolkit for the storage, presentation and analysis of protein interactions. The web interface provides both textual and graphical representations of protein interactions, and allows exploring interaction net-works in the context of the GO annotations of th ..."
Abstract - Cited by 213 (13 self) - Add to MetaCart
IntAct provides an open source database and toolkit for the storage, presentation and analysis of protein interactions. The web interface provides both textual and graphical representations of protein interactions, and allows exploring interaction net-works in the context of the GO annotations
Results 1 - 10 of 1,415