loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Data Engineering (ICDE'05)
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
Tokyo, Japan
April 05-April 08
ISBN: 0-7695-2285-8
ASCII Text
x 
 
Lin Guo, Jayavel Shanmugasundaram, Kevin Beyer, Eugene Shekita, "Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases," Data Engineering, International Conference on, pp. 298-309, 21st International Conference on Data Engineering (ICDE'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICDE.2005.59,
author = {Lin Guo and Jayavel Shanmugasundaram and Kevin Beyer and Eugene Shekita},
title = {Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases},
journal ={Data Engineering, International Conference on},
volume = {0},
year = {2005},
issn = {1084-4627},
pages = {298-309},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.59},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Engineering, International Conference on
TI - Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
SN - 1084-4627
SP298
EP309
A1 - Lin Guo,
A1 - Jayavel Shanmugasundaram,
A1 - Kevin Beyer,
A1 - Eugene Shekita,
PY - 2005
KW - null
VL - 0
JA - Data Engineering, International Conference on
ER -
 
Lin Guo, Cornell University
Jayavel Shanmugasundaram, Cornell University
Kevin Beyer, IBM Almaden Research Center
Eugene Shekita, IBM Almaden Research Center
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 queries over text columns. Our main contribution is a new family of inverted list indices and associated query algorithms that can support SVR efficiently in update-intensive databases, where the structured data values (and hence the scores of documents) change frequently. Our experimental results on real and synthetic data sets using BerkeleyDB show that we can support SVR efficiently in relational databases.
Citation:
Lin Guo, Jayavel Shanmugasundaram, Kevin Beyer, Eugene Shekita, "Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases," icde, pp.298-309, 21st International Conference on Data Engineering (ICDE'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.