Sciweavers

493 search results - page 27 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
DEBU
2008
139views more  DEBU 2008»
14 years 9 months ago
Testing SQL Server's Query Optimizer: Challenges, Techniques and Experiences
Query optimization is an inherently complex problem, and validating the correctness and effectiveness of a query optimizer can be a task of comparable complexity. The overall proc...
Leo Giakoumakis, César A. Galindo-Legaria
JALC
2002
97views more  JALC 2002»
14 years 9 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 11 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
BMCBI
2006
145views more  BMCBI 2006»
14 years 9 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 2 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...