Sciweavers

1542 search results - page 197 / 309
» Using Queries to Improve Database Reverse Engineering
Sort
View
WWW
2002
ACM
15 years 10 months ago
Expert agreement and content based reranking in a meta search environment using Mearf
Recent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective ...
B. Uygar Oztekin, George Karypis, Vipin Kumar
ICDE
2010
IEEE
170views Database» more  ICDE 2010»
15 years 9 months ago
Workload Driven Index Defragmentation
Decision support queries that scan large indexes can suffer significant degradation in I/O performance due to index fragmentation. DBAs rely on rules of thumb that use index size a...
Manoj Syamala, Vivek R. Narasayya
SBBD
2004
106views Database» more  SBBD 2004»
14 years 11 months ago
Twisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
César Feijó Nadvorny, Carlos A. Heus...
CIKM
2009
Springer
15 years 4 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
SIGCOMM
2009
ACM
15 years 4 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...