Sciweavers

1709 search results - page 113 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
WWW
2007
ACM
16 years 5 months ago
Globetp: template-based database replication for scalable web applications
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
Tobias Groothuyse, Swaminathan Sivasubramanian, Gu...
130
Voted
SIGIR
2010
ACM
15 years 9 months ago
Studying trailfinding algorithms for enhanced web search
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
Adish Singla, Ryen White, Jeff Huang
DEXAW
2010
IEEE
201views Database» more  DEXAW 2010»
15 years 3 months ago
Keyword Extraction Using Word Co-occurrence
—A common strategy to assign keywords to documents is to select the most appropriate words from the document text. One of the most important criteria for a word to be selected as...
Christian Wartena, Rogier Brussee, Wout Slakhorst
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 5 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
16 years 5 months ago
Spark: top-k keyword query in relational databases
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...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou