664 search results - page 38 / 133 » Generalized Search Trees for Database Systems |
293
click to vote
SIGMOD
2007
ACM
16 years 7 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...
236
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
301
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
193
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
244
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving tow...