Sciweavers

PVLDB
2008
120views more  PVLDB 2008»
13 years 9 months ago
On the provenance of non-answers to queries over extracted data
In information extraction, uncertainty is ubiquitous. For this reason, it is useful to provide users querying extracted data with explanations for the answers they receive. Provid...
Jiansheng Huang, Ting Chen, AnHai Doan, Jeffrey F....
LISP
2008
104views more  LISP 2008»
13 years 10 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
ER
2008
Springer
157views Database» more  ER 2008»
14 years 4 hour ago
Retune: Retrieving and Materializing Tuple Units for Effective Keyword Search over Relational Databases
The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational rel...
Guoliang Li, Jianhua Feng, Lizhu Zhou
VLDB
1989
ACM
98views Database» more  VLDB 1989»
14 years 2 months ago
A Family of Incomplete Relational Database Models
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
Adegbemiga Ola, Gultekin Özsoyoglu
CIKM
2009
Springer
14 years 4 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang