2070 search results - page 193 / 414 » Querying Communities in Relational Databases |
184
click to vote
ICDE
2003
IEEE
16 years 29 days ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
ICDT
1995
ACM
15 years 3 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
100
click to vote
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
100
click to vote
ICDT
2003
ACM
15 years 4 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...