Sciweavers

237 search results - page 41 / 48
» Efficient Query Processing on the Relational Quadtree
Sort
View
PVLDB
2008
205views more  PVLDB 2008»
13 years 7 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
14 years 2 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
CIKM
1994
Springer
14 years 1 days ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 2 days ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
DEXAW
2003
IEEE
131views Database» more  DEXAW 2003»
14 years 1 months ago
Having a BLAST: Analyzing Gene Sequence Data with BlastQuest
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...