Sciweavers

349 search results - page 10 / 70
» Query Rewriting for Semistructured Data
Sort
View
DOOD
1995
Springer
124views Database» more  DOOD 1995»
15 years 5 months ago
Querying Semistructured Heterogeneous Information
Abstract. Semistructured data has no absolute schema xed in advance and its structure may be irregular or incomplete. Such data commonly arises in sources that do not impose a rigi...
Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jef...
EDBTW
2006
Springer
15 years 5 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
109
Voted
VLDB
2001
ACM
153views Database» more  VLDB 2001»
15 years 6 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
111
Voted
ICDT
2007
ACM
158views Database» more  ICDT 2007»
15 years 8 months ago
Coupling Fragments of XPath with XML Indexing and Query Decomposition
Abstract. Recent studies have proposed structural summary techniques for pathquery evaluation on semi-structured data sources. One major line of this research
George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, ...
108
Voted
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 6 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce