Sciweavers

559 search results - page 73 / 112
» XML design for relational storage
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
IPSN
2007
Springer
14 years 1 months ago
FlashDB: dynamic self-tuning database for NAND flash
FlashDB is a self-tuning database optimized for sensor networks using NAND flash storage. In practical systems flash is used in different packages such as on-board flash chips,...
Suman Nath, Aman Kansal
WWW
2010
ACM
14 years 2 months ago
What is disputed on the web?
We present a method for automatically acquiring of a corpus of disputed claims from the web. We consider a factual claim to be disputed if a page on the web suggests both that the...
Rob Ennals, Dan Byler, John Mark Agosta, Barbara R...
JCDL
2005
ACM
98views Education» more  JCDL 2005»
14 years 1 months ago
Using collection descriptions to enhance an aggregation of harvested item-level metadata
As an increasing number of digital library projects embrace the harvesting of item-level descriptive metadata, issues of description granularity and concerns about potential loss ...
Muriel Foulonneau, Timothy W. Cole, Thomas G. Habi...