3368 search results - page 350 / 674 » The Complexity of Query Reliability |
188
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
197
click to vote
DEXA
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
203
Voted
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
196
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
205
click to vote
PVLDB
2008
15 years 6 months ago
2008
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...