Sciweavers

613 search results - page 32 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
RECSYS
2010
ACM
15 years 2 months ago
Interactive recommendations in social endorsement networks
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
Theodoros Lappas, Dimitrios Gunopulos
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 5 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
CIKM
2009
Springer
15 years 8 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
FQAS
2006
Springer
106views Database» more  FQAS 2006»
15 years 5 months ago
A Functional Model for Data Analysis
We present a functional model for the analysis of large volumes of detailed transactional data, accumulated over time. In our model, the data schema is an acyclic graph with a sing...
Nicolas Spyratos
IJSWIS
2008
135views more  IJSWIS 2008»
15 years 1 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...