Sciweavers

347 search results - page 22 / 70
» Keyword search on structured and semi-structured data
Sort
View
SAC
2006
ACM
14 years 1 months ago
Automatic structured query transformation over distributed digital libraries
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
M. Elena Renda, Umberto Straccia
SIGMOD
2007
ACM
413views Database» more  SIGMOD 2007»
14 years 7 months ago
Effective keyword-based selection of relational databases
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...
Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
IADIS
2008
13 years 9 months ago
Aggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 8 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano