144 search results - page 4 / 29 » Top-k Ranked Document Search in General Text Databases |
SIGMOD
2001
ACM
14 years 11 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
ICDE
2008
IEEE
15 years 3 days ago
2008
IEEE
Search engine technology plays an important role in Web information retrieval. However, with Internet information explosion, traditional searching techniques cannot provide satisfa...
CIKM
2009
Springer
14 years 5 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
SIGMOD
2003
ACM
14 years 11 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
SIGMOD
2007
ACM
14 years 11 months ago
2007
ACM
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...