2850 search results - page 487 / 570 » Answering Queries using Humans, Algorithms and Databases |
111
click to vote
IJCAI
2001
15 years 3 months ago
2001
This paper presents a new method for building domain-specific web search engines. Previous methods eliminate irrelevant documents from the pages accessed using heuristics based on...
144
click to vote
CF
2007
ACM
15 years 5 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
107
click to vote
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
86
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
204
Voted
VLDB
2001
ACM
16 years 2 months ago
2001
ACM
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...