Sciweavers

2883 search results - page 117 / 577
» Algorithms for merged indexes
Sort
View
WWW
2008
ACM
14 years 10 months ago
Performance of compressed inverted list caching in search engines
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
Jiangong Zhang, Xiaohui Long, Torsten Suel
MOBIDE
2003
ACM
14 years 3 months ago
Consistency mechanisms for a distributed lookup service supporting mobile applications
This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches loca...
Christoph Lindemann, Oliver P. Waldhorst
WWW
2010
ACM
14 years 5 months ago
The anatomy of an ad: structured indexing and retrieval for sponsored search
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
Michael Bendersky, Evgeniy Gabrilovich, Vanja Josi...
SAC
2006
ACM
14 years 4 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
14 years 2 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen