Sciweavers

493 search results - page 72 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 11 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
16 years 6 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
ICDE
2010
IEEE
208views Database» more  ICDE 2010»
16 years 6 months ago
Intensional Associations in Dataspaces
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Bl...
DLOG
2008
15 years 8 months ago
Explanation in DL-Lite
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
Alexander Borgida, Diego Calvanese, Mariano Rodrig...
DEXA
2005
Springer
117views Database» more  DEXA 2005»
15 years 11 months ago
Efficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, ...