2121 search results - page 335 / 425 » Indexing Incomplete Databases |
176
click to vote
PVLDB
2008
15 years 5 months ago
2008
The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structu...
181
click to vote
JIDM
2010
15 years 4 months ago
2010
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
300
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
274
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
283
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...