Sciweavers

3368 search results - page 181 / 674
» The Complexity of Query Reliability
Sort
View
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
15 years 11 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
16 years 7 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
EDBT
2008
ACM
124views Database» more  EDBT 2008»
16 years 6 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
15 years 11 months ago
PiQA: An Algebra for Querying Protein Data Sets
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
Sandeep Tata, Jignesh M. Patel
WWW
2008
ACM
16 years 7 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...