Sciweavers

269 search results - page 5 / 54
» Evaluating Nested Queries on XML Data
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
MFCS
2009
Springer
14 years 2 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
CIKM
2007
Springer
14 years 1 months ago
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems. H...
Fianny Ming-fei Jiang, Jian Pei, Ada Wai-Chee Fu
VLDB
2002
ACM
97views Database» more  VLDB 2002»
13 years 7 months ago
Structural Function Inlining Technique for Structurally Recursive XML Queries
Structurally recursive XML queries are an important query class that follows the structure of XML data. At present, it is difficult for XQuery to type and optimize structurally re...
Chang-Won Park, Jun-Ki Min, Chin-Wan Chung
CSR
2007
Springer
14 years 1 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur