Sciweavers

1300 search results - page 210 / 260
» XML Query Processing and Optimization
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 6 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
WWW
2007
ACM
16 years 2 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
IGIS
1994
156views GIS» more  IGIS 1994»
15 years 5 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
RECSYS
2009
ACM
15 years 8 months ago
Regret-based optimal recommendation sets in conversational recommender systems
Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an ap...
Paolo Viappiani, Craig Boutilier
104
Voted
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 1 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis