2859 search results - page 94 / 572 » Querying Complex Structured Databases |
BTW
2007
Springer
14 years 2 months ago
2007
Springer
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
ALGORITHMICA
2002
13 years 8 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
FUIN
2002
13 years 7 months ago
2002
Abstract. In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are us...