Sciweavers

708 search results - page 72 / 142
» A Genetic Algorithm for Database Query Optimization
Sort
View
TJS
2008
105views more  TJS 2008»
13 years 8 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...
BMCBI
2011
13 years 14 days ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
CIKM
2004
Springer
14 years 2 months ago
Optimizing web search using web click-through data
The performance of web search engines may often deteriorate due to the diversity and noisy information contained within web pages. User click-through data can be used to introduce...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Yong Yu, W...
VLDB
2002
ACM
98views Database» more  VLDB 2002»
13 years 8 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...
GIS
2007
ACM
14 years 23 days ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref