Sciweavers

505 search results - page 82 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
APWEB
2005
Springer
15 years 3 months ago
Using Probabilistic Latent Semantic Analysis for Personalized Web Search
Web users use search engine to find useful information on the Internet. However current web search engines return answer to a query independent of specific user information need. S...
Chenxi Lin, Gui-Rong Xue, Hua-Jun Zeng, Yong Yu
ICTAI
2010
IEEE
14 years 7 months ago
The BioASP Library: ASP Solutions for Systems Biology
Abstract--Today's molecular biology is confronted with enormous amounts of data, generated by new high-throughput technologies, along with an increasing number of biological m...
Martin Gebser, Arne König, Torsten Schaub, Sv...
DASFAA
2008
IEEE
105views Database» more  DASFAA 2008»
15 years 4 months ago
Redundant Array of Inexpensive Nodes for DWS
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
VLDB
2007
ACM
118views Database» more  VLDB 2007»
15 years 9 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...