Sciweavers

5726 search results - page 143 / 1146
» Supporting annotations on relations
Sort
View
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
15 years 3 days ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
VLDB
2007
ACM
144views Database» more  VLDB 2007»
14 years 4 months ago
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Je...
DEBU
2010
114views more  DEBU 2010»
13 years 10 months ago
Enhancing Keyword Search in Relational Databases Using Nearly Duplicate Records
The importance of supporting keyword searches on relations has been widely recognized. Different from the existing keyword search techniques on relations, this paper focuses on ne...
Xiaochun Yang, Bin Wang, Guoren Wang, Ge Yu
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
14 years 4 months ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
ECOOP
2007
Springer
14 years 2 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr