Sciweavers

2070 search results - page 195 / 414
» Querying Communities in Relational Databases
Sort
View
ICDT
1997
ACM
97views Database» more  ICDT 1997»
15 years 3 months ago
Queries and Computation on the Web
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...
Serge Abiteboul, Victor Vianu
EDBTW
2010
Springer
15 years 2 months ago
Text-to-query: dynamically building structured analytics to illustrate textual content
Successfully structuring information in databases, OLAP cubes, and XML is a crucial element in managing data nowadays. However this process brought new challenges to usability. It...
Raphaël Thollot, Falk Brauer, Wojciech M. Bar...
80
Voted
ALT
2000
Springer
15 years 4 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
140
Voted
ICDE
2012
IEEE
256views Database» more  ICDE 2012»
13 years 2 months ago
Micro-Specialization in DBMSes
Abstract—Relational database management systems are general in the sense that they can handle arbitrary schemas, queries, and modifications; this generality is implemented using...
Rui Zhang, Richard T. Snodgrass, Saumya Debray
103
Voted
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
15 years 5 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...