Sciweavers

1018 search results - page 80 / 204
» On the minimization of XPath queries
Sort
View
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 4 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
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
16 years 1 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
15 years 8 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 2 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 1 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy