Sciweavers

736 search results - page 94 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 3 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PPSWR
2005
Springer
14 years 2 months ago
Marriages of Convenience: Triples and Graphs, RDF and XML in Web Querying
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
Tim Furche, François Bry, Oliver Bolzer
ADC
2010
Springer
214views Database» more  ADC 2010»
13 years 4 months ago
Building a dynamic classifier for large text data collections
Due to the lack of in-built tools to navigate the web, people have to use external solutions to find information. The most popular of these are search engines and web directories....
Pavel Kalinov, Bela Stantic, Abdul Sattar
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 9 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano