Sciweavers

1018 search results - page 45 / 204
» On the minimization of XPath queries
Sort
View
SIGMOD
2002
ACM
196views Database» more  SIGMOD 2002»
16 years 19 hour ago
Storing and querying ordered XML using a relational database system
XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to st...
Igor Tatarinov, Stratis Viglas, Kevin S. Beyer, Ja...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
15 years 5 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
EDBTW
2006
Springer
15 years 3 months ago
Implementing a Linguistic Query Language for Historic Texts
Abstract. We describe design and implementation of the linguistic query language DDDquery. This language aims at querying a large linguistic database storing a corpus of richly ann...
Lukas Faulstich, Ulf Leser, Thorsten Vitt
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 6 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 19 hour ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang