Sciweavers

303 search results - page 20 / 61
» Using a compact tree to index and query XML data
Sort
View
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 9 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
PODS
2008
ACM
204views Database» more  PODS 2008»
14 years 7 months ago
Annotated XML: queries and provenance
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
J. Nathan Foster, Todd J. Green, Val Tannen
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 7 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
TIME
2005
IEEE
14 years 1 months ago
An XML-Based Framework for Temporal Database Implementation
This paper presents an XML-based approach to implementing the parametric model of temporal databases. In the parametric model, attribute values are functions of time and the entir...
Seo-Young Noh, Shashi K. Gadia
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 7 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung