Sciweavers

2859 search results - page 91 / 572
» Querying Complex Structured Databases
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 8 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 2 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
SEMCO
2008
IEEE
14 years 2 months ago
TcruziKB: Enabling Complex Queries for Genomic Data Exploration
We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable ity and ...
Pablo N. Mendes, Bobby McKnight, Amit P. Sheth, Je...
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
13 years 10 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi