Sciweavers

1160 search results - page 33 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
13 years 1 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
ICEIS
2006
IEEE
14 years 5 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
CIKM
2008
Springer
14 years 29 days ago
Modeling and exploiting query interactions in database systems
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing per...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
15 years 10 days ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
CIKM
2004
Springer
14 years 4 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu