Sciweavers

135 search results - page 16 / 27
» Sorting and Searching Algorithms: A Cookbook
Sort
View
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 7 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
WWW
2008
ACM
14 years 8 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 27 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 7 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 12 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross