scholarly journals Combining Structural and Textual Contexts for Compressing Semistructured Databases

2006 ◽  
Author(s):  
J. Adiego ◽  
P. De la Fuente ◽  
G. Navarro
Keyword(s):  
Semistructured Databases

Designing Semistructured Databases: A Conceptual Approach

2001 ◽  
pp. 12-21 ◽  
Author(s):  
Mong Li Lee ◽  
Sin Yeung Lee ◽  
Tok Wang Ling ◽  
Gillian Dobbie ◽  
Leonid A. Kalinichenko
Keyword(s):  
Conceptual Approach ◽  
Semistructured Databases

Unauthorized inferences in semistructured databases

2006 ◽  
Vol 176 (22) ◽  
pp. 3269-3299 ◽  
Author(s):  
Csilla Farkas ◽  
Alexander Brodsky ◽  
Sushil Jajodia
Keyword(s):  
Semistructured Databases

scholarly journals Accommodating Changes in Semistructured Databases Using Multidimensional OEM

2002 ◽  
pp. 360-373 ◽  
Author(s):  
Yannis Stavrakas ◽  
Manolis Gergatsoulis ◽  
Christos Doulkeridis ◽  
Vassilis Zafeiris
Keyword(s):  
Semistructured Databases

MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

2006 ◽  
Vol 17 (03) ◽  
pp. 493-506 ◽  
Author(s):  
SERGEY AFONIN ◽  
ELENA KHAZOVA
Keyword(s):  
Query Processing ◽  
Regular Language ◽  
Regular Languages ◽  
Finite Alphabet ◽  
Finitely Generated ◽  
Semistructured Databases ◽  
Rational Subset ◽  
Finite Set ◽  
Rational Sets

Let Σ be a finite alphabet. A set [Formula: see text] of regular languages over Σ is called rational if there exists a finite set [Formula: see text] of regular languages over Σ such that [Formula: see text] is a rational subset of the finitely generated semigroup [Formula: see text] with [Formula: see text] as the set of generators and language concatenation as a product. We prove that for any rational set [Formula: see text] and any regular language R ⊆ Σ* it is decidable (1) whether [Formula: see text] or not, and (2) whether [Formula: see text] is finite or not. Possible applications to semistructured databases query processing are discussed.

Sign in / Sign up

Export Citation Format

Share Document