470 search results - page 81 / 94 » Privacy-Preserving Queries over Relational Databases |
PODS
2003
ACM
14 years 8 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
NGITS
1999
Springer
14 years 25 days ago
1999
Springer
The integration of information from multiple databases has been an enduring subject of research for over 20 years, and many different solutions have been attempted or proposed. Mis...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...