Sciweavers

40 search results - page 7 / 8
» Unlocking Keys for XML Trees
Sort
View
ICDT
2007
ACM
185views Database» more  ICDT 2007»
13 years 11 months ago
Characterization of the Interaction of XML Functional Dependencies with DTDs
With the rise of XML as a standard model of data exchange, XML functional dependencies (XFDs) have become important to areas such as key analysis, document normalization, and data ...
Lucja Kot, Walker M. White
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 5 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 6 months ago
Ontology-Aware Search on XML-based Electronic Medical Records
As the use of Electronic Medical Records (EMRs) becomes more widespread, so does the need for effective information discovery on them. Recently proposed EMR standards are XML-based...
Anand Ranganathan, Fernando Farfán, Redmond...
LICS
2010
IEEE
13 years 3 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
13 years 10 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...